Cites work
Cited in
(18)- Completely non-clausal theorem proving
- Proofs and countermodels in non-classical logics
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- On the Meaning of Logical Completeness
- König's lemma, the ω-Rule and primitive recursive arithmetic
- Syntactical and semantical properties of simple type theory
- Algebraic proof theory for substructural logics: cut-elimination and completions
- From Schütte’s Formal Systems to Modern Automated Deduction
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- Set-theoretic reflection is equivalent to induction over well-founded classes
- GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Sequent-type rejection systems for finite-valued non-deterministic logics
- Feferman's completeness theorem
- Assertion, assumption, and deduction
- Geometric theories in inquisitive modal logic
- Iterating reflection over intuitionistic arithmetic
- De Finettian logics of indicative conditionals. II: Proof theory and algebraic semantics
This page was built for publication: Ein System des Verknüpfenden Schliessens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3233196)