default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Indrzejczak
Person information
- affiliation: University of Lodz, Department of Logic, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Andrzej Indrzejczak, Yaroslav I. Petrukhin:
Bisequent Calculi for Neutral Free Logic with Definite Descriptions. ARQNL@IJCAR 2024: 48-61- [c9]Andrzej Indrzejczak:
When Epsilon meets Lambda: Extended Leśniewski's Ontology. ARQNL@IJCAR 2024: 62-79 - 2023
- [j11]Andrzej Indrzejczak
:
Bisequent Calculus for Four-Valued Quasi-Relevant Logics: Cut Elimination and Interpolation. J. Autom. Reason. 67(4): 37 (2023) - [j10]Andrzej Indrzejczak:
Russellian Definite Description Theory - a Proof Theoretic Approach. Rev. Symb. Log. 16(2): 624-649 (2023) - [c8]Andrzej Indrzejczak, Yaroslav I. Petrukhin:
A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus. CADE 2023: 325-343 - [c7]Andrzej Indrzejczak, Nils Kürbis:
A Cut-Free, Sound and Complete Russellian Theory of Definite Descriptions. TABLEAUX 2023: 112-130 - [c6]Andrzej Indrzejczak:
Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators. TABLEAUX 2023: 131-149 - 2022
- [c5]Andrzej Indrzejczak:
Leśniewski's Ontology - Proof-Theoretic Characterization. IJCAR 2022: 541-558 - [e1]Andrzej Indrzejczak, Michal Zawidzki:
Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications, NCL 2022, Łódź, Poland, 14-18 March 2022. EPTCS 358, 2022 [contents] - 2021
- [j9]Andrzej Indrzejczak:
Free Logics are Cut-Free. Stud Logica 109(4): 859-886 (2021) - [c4]Andrzej Indrzejczak, Michal Zawidzki:
Tableaux for Free Logics with Descriptions. TABLEAUX 2021: 56-73 - [i1]Andrzej Indrzejczak, Michal Zawidzki:
Tableaux for Free Logics with Descriptions. CoRR abs/2107.07228 (2021) - 2020
- [c3]Andrzej Indrzejczak:
Existence, Definedness and Definite Descriptions in Hybrid Modal Logic. AiML 2020: 349-368
2010 – 2019
- 2019
- [j8]Andrzej Indrzejczak:
Cut Elimination in Hypersequent Calculus for some Logics of linear Time. Rev. Symb. Log. 12(4): 806-822 (2019) - [c2]Andrzej Indrzejczak:
Two Is Enough - Bisequent Calculus for S5. FroCos 2019: 277-294 - 2018
- [c1]Andrzej Indrzejczak:
Cut-Free Modal Theory of Definite Descriptions. Advances in Modal Logic 2018: 387-406 - 2016
- [j7]Andrzej Indrzejczak:
Linear Time in Hypersequent Framework. Bull. Symb. Log. 22(1): 121-144 (2016) - 2015
- [j6]Andrzej Indrzejczak:
Eliminability of cut in hypersequent calculi for some modal logics of linear frames. Inf. Process. Lett. 115(2): 75-81 (2015) - 2014
- [j5]Andrzej Indrzejczak:
Introduction. Stud Logica 102(6): 1091-1094 (2014) - [j4]Andrzej Indrzejczak:
A Survey of Nonstandard Sequent Calculi. Stud Logica 102(6): 1295-1322 (2014) - 2011
- [j3]Andrzej Indrzejczak:
Possible Worlds in Use. Stud Logica 99(1-3): 229-248 (2011)
2000 – 2009
- 2003
- [j2]Andrzej Indrzejczak:
A Labelled Natural Deduction System for Linear Temporal Logic. Stud Logica 75(3): 345-376 (2003)
1990 – 1999
- 1998
- [j1]Andrzej Indrzejczak:
Cut-free Double Sequent Calculus for S5. Log. J. IGPL 6(3): 505-516 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
