scientific article; zbMATH DE number 4033738
From MaRDI portal
Publication:3773876
Recommendations
Cited in
(only showing first 100 items - show all)- The metamathematics of ergodic theory
- Full operational set theory with unbounded existential quantification and power set
- Reverse mathematics and well-ordering principles: a pilot study
- Strong normalization property for second order linear logic
- Proof theory. 2nd ed
- Normal functors, power series and -calculus
- The metamathematics of scattered linear orderings
- Cut-elimination and interpolation for \(\Omega\)-logic
- Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction
- Bounded arithmetic for NC, ALogTIME, L and NL
- Proof systems for infinite behaviours
- Existential instantiation and normalization in sequent natural deduction
- 2-sequent calculus: A proof theory of modalities
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
- Fixed points in Peano arithmetic with ordinals
- \(\Pi_ 2^ 1\)-logic and uniformization in the analytical hierarchy
- Handbook of proof theory
- Well-ordering proofs for Martin-Löf type theory
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Gentzen-type systems, resolution and tableaux
- Combinatory reduction systems: Introduction and survey
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Reverse mathematics and ordinal exponentiation
- A note on the \(\omega\)-incompleteness formalization
- A finite analog to the Löwenheim-Skolem theorem
- On schematological equivalence of partially interpreted dataflow networks
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions
- A proof-theoretic investigation of a logic of positions
- Theories with self-application and computational complexity.
- Derivatives of normal functions and \(\omega \)-models
- A cut-free calculus for second-order Gödel logic
- Cut elimination, identity elimination, and interpolation in super-Belnap logics
- The omega-rule interpretation of transfinite provability logic
- An approach to infinitary temporal proof theory
- Paraconsistent informational logic
- Proof theory. An introduction
- Generating plans in linear logic. I: Actions as proofs
- Streams and strings in formal proofs.
- The complexity of predicate default logic over a countable domain
- Provability algebras and proof-theoretic ordinals. I
- MELL in the calculus of structures
- Computational adequacy for recursive types in models of intuitionistic set theory
- Totality in applicative theories
- The implicit commitment of arithmetical theories and its semantic core
- Validities, antivalidities and contingencies: a multi-standard approach
- Truth and the philosophy of mathematics
- On the proof theory of infinitary modal logic
- Sequent-calculi for metainferential logics
- From axioms to synthetic inference rules via focusing
- Minimal bad sequences are necessary for a uniform Kruskal theorem
- Is cut-free logic fit for unrestricted abstraction?
- Proof theory of paraconsistent weak Kleene logic
- One-step modal logics, intuitionistic and classical. I
- Cut-elimination: syntax and semantics
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Proof theory and ordinal analysis
- Notation systems for infinitary derivations
- Valuations: bi, tri, and tetra
- A hierarchy of classical and paraconsistent logics
- A logic for quantum register measurements
- Proof-theoretic strengths of the well-ordering principles
- Paraconsistency and the need for infinite semantics
- Applicative theories for logarithmic complexity classes
- Cut elimination for the unified logic
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations
- Languages of logic and their applications
- The Church-Fitch knowability paradox in the light of structural proof theory
- On Feferman's operational set theory \textsf{OST}
- Deduction chains for common knowledge
- Herbrand analyses
- One step is enough
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
- Neutral free logic: motivation, proof theory and models
- Finite presentability of strongly finite dilators
- Proofs with monotone cuts
- Sharpened lower bounds for cut elimination
- Hypersequent calculi for S5: the methods of cut elimination
- The Veblen functions for computability theorists
- Cut as consequence
- On the non-confluence of cut-elimination
- Proofs and computations
- Open questions in reverse mathematics
- Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
- The reverse mathematics of wqos and bqos
- What is a paraconsistent logic?
- Higman's lemma and its computational content
- ST, LP and tolerant metainferences
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Two (or three) notions of finitism
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- Paraconsistent conjectural deduction based on logical entropy measures. I: C-systems as non-standard inference framework
- scientific article; zbMATH DE number 4033739 (Why is no real title available?)
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- The role of parameters in bar rule and bar induction
- Intuitionistic three-valued logic and logic programming
- Ordinal inequalities, transfinite induction, and reverse mathematics
- About some symmetries of negation
- Derived sequences and reverse mathematics
- Minimal invariant spaces in formal topology
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773876)
