The following pages link to Proof theory. 2nd ed (Q1086559):
Displaying 50 items.
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Defeasible inheritance on cyclic networks (Q1402730) (← links)
- Sequent calculi for Visser's propositional logics (Q1409300) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Extended normal form theorems for logical proofs from axioms (Q1575930) (← links)
- Derivatives of normal functions and \(\omega \)-models (Q1661685) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- Interpolation methods for Dunn logics and their extensions (Q1685574) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- A note on Gentzen's ordinal assignment (Q1734262) (← links)
- Paraconsistent informational logic (Q1775866) (← links)
- A proof-theoretical investigation of global intuitionistic (fuzzy) logic (Q1778065) (← links)
- Analogy calculus (Q1802070) (← links)
- The foundation of a generic theorem prover (Q1823013) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- Dependent choice, `quote' and the clock (Q1884884) (← links)
- Generalizing theorems in real closed fields (Q1899140) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Sequent calculi for intuitionistic Gödel-Löb logic (Q1982008) (← links)
- Determinate logic and the axiom of choice (Q2007876) (← links)
- A note on the unprovability of consistency in formal theories of truth (Q2056216) (← links)
- Patterns of resemblance and Bachmann-Howard fixed points (Q2064043) (← links)
- Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\) (Q2085577) (← links)
- On Takeuti's early view of the concept of set (Q2097059) (← links)
- ``Gaisi Takeuti's finitist standpoint'' and its mathematical embodiment (Q2097064) (← links)
- Sequent-calculi for metainferential logics (Q2118968) (← links)
- Is cut-free logic fit for unrestricted abstraction? (Q2131274) (← links)
- Sequent calculi for the propositional logic of HYPE (Q2144182) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- Higher-order logic and disquotational truth (Q2155943) (← links)
- Interpolation in extensions of first-order logic (Q2186699) (← links)
- A proof theory for the logic of provability in true arithmetic (Q2193977) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- Logics of intuitionistic Kripke-Platek set theory (Q2231694) (← links)
- A simple logical matrix and sequent calculus for Parry's logic of analytic implication (Q2243548) (← links)
- Free logics are cut-free (Q2243550) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
- An ordinal analysis for theories of self-referential truth (Q2267754) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Robust multiplicity with (transfinitely) vanishing naiveté (Q2280050) (← links)
- Proof-theoretic strengths of the well-ordering principles (Q2309489) (← links)
- The finitistic consistency of Heck's predicative Fregean system (Q2345392) (← links)
- A normal form for logical derivations implying one for arithmetic derivations (Q2367413) (← links)
- Gentzen's consistency proof without heightlines (Q2377348) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
