Andrzej Indrzejczak

According to our database, Andrzej Indrzejczak authored at least 24 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Proceedings Eleventh International Conference on Non-Classical Logics. Theory and Applications.

Andrzej Indrzejczak, Michal Zawidzki

CoRR, 2024

Uniform Cut-free Bisequent Calculi for Three-valued Logics.

Andrzej Indrzejczak, Yaroslav I. Petrukhin

CoRR, 2024

Definite Descriptions and Hybrid Tense Logic.

Andrzej Indrzejczak, Michal Zawidzki

CoRR, 2024

Bisequent Calculi for Neutral Free Logic with Definite Descriptions.

Andrzej Indrzejczak, Yaroslav I. Petrukhin

Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024) affiliated with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), 2024

When Epsilon meets Lambda: Extended Leśniewski's Ontology.

Andrzej Indrzejczak

Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024) affiliated with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), 2024

2023

Bisequent Calculus for Four-Valued Quasi-Relevant Logics: Cut Elimination and Interpolation.

Andrzej Indrzejczak

J. Autom. Reason., December, 2023

Russellian Definite Description Theory - a Proof Theoretic Approach.

Andrzej Indrzejczak

Rev. Symb. Log., June, 2023

A Cut-Free, Sound and Complete Russellian Theory of Definite Descriptions.

Andrzej Indrzejczak, Nils Kürbis

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators.

Andrzej Indrzejczak

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus.

Andrzej Indrzejczak, Yaroslav I. Petrukhin

Proceedings of the Automated Deduction - CADE 29, 2023

2022

Leśniewski's Ontology - Proof-Theoretic Characterization.

Andrzej Indrzejczak

Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021

Free Logics are Cut-Free.

Andrzej Indrzejczak

Stud Logica, 2021

Tableaux for Free Logics with Descriptions.

Andrzej Indrzejczak, Michal Zawidzki

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

2020

Existence, Definedness and Definite Descriptions in Hybrid Modal Logic.

Andrzej Indrzejczak

Proceedings of the 13th Conference on Advances in Modal Logic, 2020

2019

Cut Elimination in Hypersequent Calculus for some Logics of linear Time.

Andrzej Indrzejczak

Rev. Symb. Log., 2019

Two Is Enough - Bisequent Calculus for S5.

Andrzej Indrzejczak

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2018

Cut-Free Modal Theory of Definite Descriptions.

Andrzej Indrzejczak

Proceedings of the Advances in Modal Logic 12, 2018

2016

Linear Time in Hypersequent Framework.

Andrzej Indrzejczak

Bull. Symb. Log., 2016

2015

Eliminability of cut in hypersequent calculi for some modal logics of linear frames.

Andrzej Indrzejczak

Inf. Process. Lett., 2015

2014

A Survey of Nonstandard Sequent Calculi.

Andrzej Indrzejczak

Stud Logica, 2014

Introduction.

Andrzej Indrzejczak

Stud Logica, 2014

2011

Possible Worlds in Use.

Andrzej Indrzejczak

Stud Logica, 2011

2003

A Labelled Natural Deduction System for Linear Temporal Logic.

Andrzej Indrzejczak

Stud Logica, 2003

1998

Cut-free Double Sequent Calculus for S5.

Andrzej Indrzejczak

Log. J. IGPL, 1998