The following pages link to (Q3285631):
Displaying 50 items.
- Nice embedding in classical logic (Q300555) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- Resolution on formula-trees (Q1098648) (← links)
- Completeness proofs for propositional logic with polynomial-time connectives (Q1123883) (← links)
- Gentzen reduction revisited (Q1140640) (← links)
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. (Q1603701) (← links)
- Sequent systems for negative modalities (Q1682296) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- A procedural criterion for final derivability in inconsistency-adaptive logics (Q1775872) (← links)
- Levels of truth (Q1903585) (← links)
- On Blass translation for Leśniewski's propositional ontology and modal logics (Q2115291) (← links)
- Is cut-free logic fit for unrestricted abstraction? (Q2131274) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Deduction chains for common knowledge (Q2506830) (← links)
- Herbrand analyses (Q2641297) (← links)
- K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You (Q3305614) (← links)
- The Truth of Proof: A Hegelian Perspective on Constructivism (Q3305649) (← links)
- Annotated Natural Deduction for Adaptive Reasoning (Q3305674) (← links)
- Toward useful type-free theories. I (Q3691666) (← links)
- Syntactical and semantical properties of simple type theory (Q3845367) (← links)
- Iterated reflection principles and the <i>ω</i>-rule (Q3966133) (← links)
- The <i>ω</i>-consistency of number theory via Herbrand's theorem (Q4077992) (← links)
- Ordinal bounds for <i>κ</i>-consistency (Q4077993) (← links)
- Ordinals connected with formal theories for transfinitely iterated inductive definitions (Q4175275) (← links)
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic (Q4586423) (← links)
- Recent Advances in Ordinal Analysis: Π<sup>1</sup><sub>2</sub>— CA and Related Systems (Q4873894) (← links)
- New Arguments for Adaptive Logics as Unifying Frame for the Defeasible Handling of Inconsistency (Q4912987) (← links)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV (Q5009678) (← links)
- “Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays (Q5013891) (← links)
- … and so on: Schütte on Naming Ordinals (Q5013893) (← links)
- Beziehungen des Ordinalzahlensystems OT(ϑ) zur Veblen-Hierarchie (Q5013915) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- The relation of <i>A</i> to Prov ˹<i>A</i>˺ in the Lindenbaum sentence algebra (Q5183473) (← links)
- PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS (Q5216971) (← links)
- Tutorial on Inconsistency-Adaptive Logics (Q5241516) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- Systems of predicative analysis (Q5344166) (← links)
- Two, Many, and Differently Many (Q5350334) (← links)
- Extensional interpretations of modal logics (Q5526119) (← links)
- Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis (Q5537358) (← links)
- A survey of proof theory (Q5569099) (← links)
- Uniform Gentzen systems (Q5594589) (← links)
- Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle (Q5596202) (← links)
- ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS (Q6041346) (← links)
- Many-valued modalities and paraconsistency (Q6623951) (← links)
