scientific article; zbMATH DE number 3358455
From MaRDI portal
Publication:5632554
Cited in
(only showing first 100 items - show all)- Normal derivations and sequent derivations
- A proof description language and its reduction system
- On sequence-conclusion natural deduction systems
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Mechanizing structural induction. II: Strategies
- What does logic have to tell us about mathematical proofs?
- A coherence theorem for canonical morphisms in Cartesian closed categories
- Partial inductive definitions
- Existential instantiation and normalization in sequent natural deduction
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
- On the idea of a general proof theory
- Prelogic of logoi
- Quantifier-complete categories
- A note on the elimination rules
- A study of Kripke-type models for some modal logics by Gentzen's sequential method
- Theory of proofs (arithmetic and analysis)
- Representing scope in intuitionistic deductions
- The inevitability of inconsistent abstract spaces
- Implementing tactics and tacticals in a higher-order logic programming language
- Combinatory reduction systems: Introduction and survey
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Set theory for verification. I: From foundations to functions
- Algebraic proofs of cut elimination
- Embedding of a free cartesian-closed category into the category of sets
- Abstract argumentation systems
- A proof-theoretic investigation of a logic of positions
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Geometry and generality in Frege's philosophy of arithmetic.
- Stabilizing quantum disjunction
- A more general general proof theory
- Reprint of: ``A more general general proof theory
- Natural deduction for bi-intuitionistic logic
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Non-strictly positive fixed points for classical natural deduction
- Natural deduction for first-order hybrid logic
- Proof nets of PN as graphs
- Typing and computational properties of lambda expressions
- The foundation of a generic theorem prover
- Extraction and verification of programs by analysis of formal proofs
- Church-Rosser property of a simple reduction for full first-order classical natural deduction
- Syntactic analysis of \(\eta\)-expansions in pure type systems.
- Natural deduction for intuitionistic linear logic
- Categorial generalization of algebraic recursion theory
- A reduction rule for Peirce formula
- On the concurrent computational content of intermediate logics
- Completeness of second-order intuitionistic propositional logic with respect to phase semantics for proof-terms
- Subatomic natural deduction for a naturalistic first-order language with non-primitive identity
- What is the meaning of proofs?. A Fregean distinction in proof-theoretic semantics
- The calculus of natural calculation
- Denotational semantics for languages of epistemic grounding based on Prawitz's theory of grounds
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
- Is cut-free logic fit for unrestricted abstraction?
- Calculi of epistemic grounding based on Prawitz's theory of grounds
- Combinatory logic with polymorphic types
- Economic reasoning with demand and supply graphs
- A refined interpretation of intuitionistic logic by means of atomic polymorphism
- Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization
- Proof-theoretic semantics and inquisitive logic
- Harmony in multiple-conclusion natural-deduction
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
- The harmony of identity
- The justification of identity elimination in Martin-Löf's type theory
- Proof, meaning and paradox: some remarks
- On paradoxes in normal form
- Steps towards a proof-theoretical semantics
- On the proof-theoretic foundation of general definition theory
- Intuitionistic hybrid logic
- Failure of completeness in proof-theoretic semantics
- Somehow things do not relate: on the interpretation of polyadic second-order logic
- Ein starker Normalisationssatz für die intuitionistische Typentheorie
- A simple proof of second-order strong normalization with permutative conversions
- The fundamental problem of general proof theory
- The naturality of natural deduction
- Incompleteness of intuitionistic propositional logic with respect to proof-theoretic semantics
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- The original sin of proof-theoretic semantics
- Proof-theoretic harmony: towards an intensional account
- Domain-free -calculus
- Arguments, proofs, and dialogues
- Generality of proofs and its Brauerian representation
- A realizability interpretation for intersection and union types
- Classical proofs as parallel programs
- Proof theory for reasoning with Euler diagrams: a logic translation and normalization
- ``Inference versus consequence revisited: inference, consequence, conditional, implication
- scientific article; zbMATH DE number 3563037 (Why is no real title available?)
- Choice sequences and reduction processes
- A formalization of Sambins's normalization for GL
- A note on harmony
- AN ANALYSIS OF THE RULES OF GENTZEN’SNJANDLJ
- A confluent reduction for the extensional typed -calculus with pairs, sums, recursion and terminal object
- Geometric theories for the algebra of real numbers
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- Two \textit{different} strong normalization proofs?
- scientific article; zbMATH DE number 7393562 (Why is no real title available?)
- The normalization theorem for extended natural deduction
- Some lambda calculi with categorical sums and products
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
- Axiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic Semantics
- An intuitionistic formula hierarchy based on high‐school identities
- Dual-context calculi for modal logic
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 Q5632554)