Leśniewski's ontology -- proof-theoretic characterization
From MaRDI portal
Publication:2104542
DOI10.1007/978-3-031-10769-6_32OpenAlexW4289103996MaRDI QIDQ2104542FDOQ2104542
Authors: Andrzej Indrzejczak 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_32
Cites Work
- Structural proof theory. With an appendix by Aarne Ranta
- Proof theory for fuzzy logics
- Title not available (Why is that?)
- Hybrid logic and its proof-theory
- Substitutional quantification and Leśniewskian quantifiers
- Title not available (Why is that?)
- On Lesniewski's elementary ontology
- Computer Science Logic
- From axioms to synthetic inference rules via focusing
- 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
- Free logics are cut-free
- Fregean Description Theory in Proof-Theoretical Setting
Cited In (5)
- Strict embedding of the elementary ontology into the monadic second-order calculus of predicates admitting the empty individual domain
- An axiomatisation of a pure calculus of names
- On some essential subsystems of Leśniewski's ontology and the equivalence between the singular Barbara and the law of Leibniz in ontology
- Title not available (Why is that?)
- A semantical investigation into Leśniewski's axiom of his ontology
Uses Software
This page was built for publication: Leśniewski's ontology -- proof-theoretic characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104542)
