Leśniewski's ontology -- proof-theoretic characterization

DOI10.1007/978-3-031-10769-6_32OpenAlexW4289103996MaRDI QIDQ2104542

Andrzej Indrzejczak

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_32

zbMATH Keywords

cut eliminationsequent calculusontologyLeśniewskicalculus of names

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semantical investigation into Leśniewski's axiom of his ontology
• A propositional fragment of Leśniewski's ontology and its formulation by the tableau method
• Leśniewski's systems of logic and foundations of mathematics
• Sequents and trees. An introduction to the theory and applications of propositional sequent calculi
• From axioms to synthetic inference rules via focusing
• Free logics are cut-free
• On Lesniewski's elementary ontology
• Proof theory for fuzzy logics
• Fregean Description Theory in Proof-Theoretical Setting
• Computer Science Logic
• Substitutional quantification and Leśniewskian quantifiers
• Hybrid logic and its proof-theory