scientific article; zbMATH DE number 3275554
From MaRDI portal
Publication:5559220
Recommendations
Cited in
(only showing first 100 items - show all)- Natural deduction based upon strict implication for normal modal logics
- Subformula and separation properties in natural deduction via small Kripke models
- Revisiting Zucker's work on the correspondence between cut-elimination and normalisation
- Bilateral inversion principles
- On the intuitionistic force of classical search (extended abstract)
- Composition of deductions within the propositions-as-types paradigm
- scientific article; zbMATH DE number 5896737 (Why is no real title available?)
- Conservation and uniform normalization in lambda calculi with erasing reductions
- Structuring metatheory on inductive definitions
- On the proof theory of Coquand's calculus of constructions
- Prolegomena to a theory of mechanized formal reasoning
- Truth and proof in intuitionism
- Learning inference by induction
- A note on the elimination rules
- 1999–2000 Winter Meeting of the Association for Symbolic Logic
- GP's LP
- The Berry paradox
- Inductive completeness of logics of programs
- Existential type systems between Church and Curry style (type-free style)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- The category of finite sets and Cartesian closed categories
- Logical foundations for programming semantics
- Partial inductive definitions as type-systems for \(\lambda\)-terms
- Theo: An interactive proof development system
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
- Antirealism, meaning and truth-conditional semantics
- What does logic have to tell us about mathematical proofs?
- Proof-theoretic semantics, a problem with negation and prospects for modality
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus
- Yet another bijection between sequent calculus and natural deduction
- Proof-theoretic semantics and feasibility
- General proof theory: introduction
- The fundamental problem of general proof theory
- A history of until
- Experiments in linear natural deduction
- Craig's interpolation theorem for the intuitionistic logic and its extensions - a semantical approach
- scientific article; zbMATH DE number 7393562 (Why is no real title available?)
- Hyper natural deduction
- The structure of free closed categories
- Plugging-in proof development environments using \textit{locks} in \(\mathsf{LF}\)
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
- Book review of: N. Kürbis, Proof and falsity: a logical investigation
- A multicontext architecture for formalizing complex reasoning
- The epistemic significance of valid inference
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
- Adding Negation to Lambda Mu
- Implication and analysis in classical Frege structures
- Functional interpretations of feasibly constructive arithmetic
- A framework for proof systems
- Principal types of BCK-lambda-terms
- Axiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic Semantics
- Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning
- When programs have to watch paint dry
- Maehara-style modal nested calculi
- Normality, non-contamination and logical depth in classical natural deduction
- The complexity of Gentzen systems for propositional logic
- Automatically Proving and Disproving Feasibility Conditions
- A generalized syllogistic inference system based on inclusion and exclusion relations
- \(\mathcal {BCDL}\): Basic constructive description logic
- Natural deduction for dual-intuitionistic logic
- Did Aristotle endorse Aristotle's thesis? A case study in Aristotle's metalogic
- Why does the proof-theory of hybrid logic work so well?
- Defining concurrent processes constructively
- Proof Terms for Generalized Natural Deduction
- Does the implication elimination rule need a minor premise?
- A simple proof of second-order strong normalization with permutative conversions
- On the intuitionistic force of classical search
- General-elimination harmony and the meaning of the logical constants
- Combining linear-time temporal logic with constructiveness and paraconsistency
- scientific article; zbMATH DE number 7559284 (Why is no real title available?)
- A binary quantifier for definite descriptions in intuitionist negative free logic: natural deduction and normalisation
- Inductive types and type constraints in the second-order lambda calculus
- Back from the future
- Variations on a theme of Curry
- Definite descriptions in intuitionist positive free logic
- On feasible numbers
- Closed categories and the theory of proofs
- A weak intuitionistic propositional logic with purely constructive implication
- A deficiency of natural deduction
- scientific article; zbMATH DE number 7243672 (Why is no real title available?)
- Rudimentary Kripke models for the intuitionistic propositional calculus
- THE AXIOM OF CHOICE IS FALSE INTUITIONISTICALLY (IN MOST CONTEXTS)
- Radical anti-realism, Wittgenstein and the length of proofs
- Coherence in linear predicate logic
- Gödel on deduction
- A study of Kripke-type models for some modal logics by Gentzen's sequential method
- Truth-values as labels: a general recipe for labelled deduction
- Natural deduction for intuitionistic linear logic
- The foundation of a generic theorem prover
- On maximal intermediate predicate constructive logics
- Steps towards a proof-theoretical semantics
- Idempotent variations on the theme of exclusive disjunction
- Proof theory for linear lattices
- Normalisation and subformula property for a system of classical logic with Tarski's rule
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
- A first order logic of effects
- Intensionality of consequence and identity of proofs in Prawitz's theory of grounds
- Ein syntaktischer Beweis für die Zulässigkeit der Schnittregel im Kalkül von Schütte für die intuitionistische Typenlogik
- Ein starker Normalisationssatz für die intuitionistische Typentheorie
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 Q5559220)
