The following pages link to Proof theory. 2nd ed (Q1086559):
Displaying 50 items.
- On elementary theories of ordinal notation systems based on reflection principles (Q281010) (← links)
- An extension of the omega-rule (Q283132) (← links)
- A sequent calculus for urn logic (Q302242) (← links)
- Proof generalization in \(\mathrm {LK}\) by second order unifier minimization (Q331619) (← links)
- The paradox of the knower revisited (Q392283) (← links)
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Proof theory and mathematical meaning of paraconsistent C-systems (Q420832) (← links)
- Classes and truths in set theory (Q450946) (← links)
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- Effective cut-elimination for a fragment of modal mu-calculus (Q454366) (← links)
- Intuitionistic fixed point theories over set theories (Q494642) (← links)
- LK, LJ, dual intuitionistic logic, and quantum logic (Q558432) (← links)
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees (Q582289) (← links)
- A sequent calculus for a negative free logic (Q622624) (← links)
- Contraction-elimination for implicational logics (Q676308) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- Proof theory. The first step into impredicativity (Q930618) (← links)
- Resolution is cut-free (Q972424) (← links)
- On the form of witness terms (Q982183) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- A proof-theoretic study of the correspondence of hybrid logic and classical logic (Q1006454) (← links)
- Patterns of resemblance of order 2 (Q1011757) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- The machinery of consistency proofs (Q1124588) (← links)
- The undecidability of \(k\)-provability (Q1176199) (← links)
- The contraction rule and decision problems for logics without structural rules (Q1181491) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- Universal algebra in higher types (Q1199827) (← links)
- Fixed points in Peano arithmetic with ordinals (Q1210139) (← links)
- Handbook of proof theory (Q1264579) (← links)
- Well-ordering proofs for Martin-Löf type theory (Q1295372) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Cut normal forms and proof complexity (Q1302302) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Syntactical results on the arithmetical completeness of modal logic (Q1319362) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Proof theory of reflection (Q1332853) (← links)
- A constructive logic behind the catch and throw mechanism (Q1337695) (← links)
- Dispensing with the continuum (Q1368388) (← links)
- Infinite versions of some problems from finite complexity theory (Q1374209) (← links)
- A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. (Q1399971) (← links)
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals (Q1400597) (← links)
