Leśniewski's ontology -- proof-theoretic characterization
From MaRDI portal
Publication:2104542
Cites work
- scientific article; zbMATH DE number 108359 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- A propositional fragment of Leśniewski's ontology and its formulation by the tableau method
- A semantical investigation into Leśniewski's axiom of his ontology
- Computer Science Logic
- Free logics are cut-free
- Fregean Description Theory in Proof-Theoretical Setting
- From axioms to synthetic inference rules via focusing
- Hybrid logic and its proof-theory
- Leśniewski's systems of logic and foundations of mathematics
- On Lesniewski's elementary ontology
- Proof theory for fuzzy logics
- Sequents and trees. An introduction to the theory and applications of propositional sequent calculi
- Structural proof theory. With an appendix by Aarne Ranta
- Substitutional quantification and Leśniewskian quantifiers
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
- scientific article; zbMATH DE number 5015951 (Why is no real title available?)
- A semantical investigation into Leśniewski's axiom of his ontology
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)
