Free Definite Description Theory – Sequent Calculi and Cut Elimination

DOI10.12775/LLP.2020.020zbMath1478.03077OpenAlexW3097669092MaRDI QIDQ5006839

Andrzej Indrzejczak

Publication date: 17 August 2021

Published in: Logic and Logical Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12775/llp.2020.020

zbMATH Keywords

free logiccut eliminationsequent calculusdefinite descriptionspartial termsdefinedness logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (4)

Proof-theory and semantics for a theory of definite descriptions ⋮ RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH ⋮ Definite Descriptions in Intuitionist Positive Free Logic ⋮ A binary quantifier for definite descriptions for cut free free logics

Uses Software

• Pesca

Cites Work

• Incomplete symbols -- definite descriptions revisited
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Gentzen calculi for the existence predicate
• Constructivism in mathematics. An introduction. Volume I
• A logical calculus with descriptions
• First-order modal logic
• Free logics are cut-free
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• Proof theory for fuzzy logics
• A logical system based on rules and its application in teaching mathematical logic
• Remarks on descriptions and natural deduction
• Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic
• Fregean Description Theory in Proof-Theoretical Setting
• CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
• A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation
• Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate
• Computer Science Logic
• Interpreting descriptions in intensional type theory
• Rule-Generation Theorem and its Applications
• An extended joint consistency theorem for a nonconstructive logic of partial terms with definite descriptions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Free Definite Description Theory – Sequent Calculi and Cut Elimination