scientific article; zbMATH DE number 4033738
From MaRDI portal
Publication:3773876
Recommendations
Cited in
(only showing first 100 items - show all)- Ordinal inequalities, transfinite induction, and reverse mathematics
- From axioms to synthetic inference rules via focusing
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Provable better-quasi-orders
- Higman's lemma and its computational content
- Gentzen-type systems, resolution and tableaux
- Proofs with monotone cuts
- Reverse mathematics and ordinal exponentiation
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- A family of metainferential logics
- Finite presentability of strongly finite dilators
- Basic logic: reflection, symmetry, visibility
- Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension
- On the logical strength of the better quasi order with three elements
- Deduction chains for common knowledge
- Proof systems for infinite behaviours
- A logical aspect of parametric polymorphism
- Full operational set theory with unbounded existential quantification and power set
- Derived sequences and reverse mathematics
- Applicative theories for logarithmic complexity classes
- The metamathematics of scattered linear orderings
- A practical implementation of simple consequence relations using inductive definitions
- Proof theory of paraconsistent weak Kleene logic
- Cut elimination for the unified logic
- The conservation theorem for differential nets
- On the metainferential solution to the semantic paradoxes
- \(\Pi_ 2^ 1\)-logic and uniformization in the analytical hierarchy
- On schematological equivalence of partially interpreted dataflow networks
- Notation systems for infinitary derivations
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Paraconsistency and the need for infinite semantics
- WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
- Functorial Fast-Growing Hierarchies
- Open questions in reverse mathematics
- (I can't get no) antisatisfaction
- Predicative collapsing principles
- Minimal invariant spaces in formal topology
- The role of parameters in bar rule and bar induction
- Cut-elimination and interpolation for \(\Omega\)-logic
- Intuitionistic three-valued logic and logic programming
- Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
- Proof theory and ordinal analysis
- On the form of witness terms
- Common knowledge does not have the Beth property
- Streams and strings in formal proofs.
- Minimal bad sequences are necessary for a uniform Kruskal theorem
- About some symmetries of negation
- Cut elimination, identity elimination, and interpolation in super-Belnap logics
- The Veblen functions for computability theorists
- Bounded arithmetic for NC, ALogTIME, L and NL
- Anti-exceptionalism, truth and the BA-plan
- Computational adequacy for recursive types in models of intuitionistic set theory
- The maximal linear extension theorem in second order arithmetic
- Cut-elimination: syntax and semantics
- Is cut-free logic fit for unrestricted abstraction?
- One-step modal logics, intuitionistic and classical. I
- A natural deduction calculus for \textbf{S4.2}
- An approach to infinitary temporal proof theory
- Strong normalization property for second order linear logic
- The metamathematics of ergodic theory
- Hypersequent calculi for S5: the methods of cut elimination
- Logica
- Generating plans in linear logic. I: Actions as proofs
- Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
- On the No-Counterexample Interpretation
- A finite analog to the Löwenheim-Skolem theorem
- Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction
- HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
- Proof theory. The first step into impredicativity
- Sequent-calculi for metainferential logics
- A categorical construction of Bachmann–Howard fixed points
- Combinatory reduction systems: Introduction and survey
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- The Church-Fitch knowability paradox in the light of structural proof theory
- scientific article; zbMATH DE number 4033739 (Why is no real title available?)
- Totality in applicative theories
- The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework)
- Proof theory. 2nd ed
- CERES: An analysis of Fürstenberg's proof of the infinity of primes
- What is a paraconsistent logic?
- ST, LP and tolerant metainferences
- Proofs and computations
- A note on ordinal exponentiation and derivatives of normal functions
- A fully classical truth theory characterized by substructural means
- A hierarchy of classical and paraconsistent logics
- Fraïssé's conjecture, partial impredicativity and well-ordering principles. I
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- A two-dimensional metric temporal logic
- On Feferman's operational set theory \textsf{OST}
- Paraconsistent conjectural deduction based on logical entropy measures. I: C-systems as non-standard inference framework
- The complexity of predicate default logic over a countable domain
- Gentzen in the 3- and 4-valued jungle
- An Introduction to Lorenzen's ‘Algebraic and Logistic Investigations on Free Lattices’ (1951)
- Derivatives of normal functions and \(\omega \)-models
- Two (or three) notions of finitism
- Provability algebras and proof-theoretic ordinals. I
- On non-deterministic functional completeness
- (Meta)inferential levels of entailment beyond the Tarskian paradigm
- Effectively dense Boolean algebras and their applications
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)
