Cut elimination for coherent theories in negation normal form

Archive for Mathematical Logic 63 (3):427-445 (2024)
  Copy   BIBTEX

Abstract

We present a cut-free sequent calculus for a class of first-order theories in negation normal form which include coherent and co-coherent theories alike. All structural rules, including cut, are admissible.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-023-00902-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Weak theories of linear algebra.Neil Thapen & Michael Soltys - 2005 - Archive for Mathematical Logic 44 (2):195-208.
Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization.Ryo Takemura - 2021 - Archive for Mathematical Logic 60 (7):783-813.
A complete many-valued logic with product-conjunction.Petr Hájek, Lluis Godo & Francesc Esteva - 1996 - Archive for Mathematical Logic 35 (3):191-208.
On locally modular, weakly minimal theories.James Loveys - 1993 - Archive for Mathematical Logic 32 (3):173-194.
Weak essentially undecidable theories of concatenation, part II.Juvenal Murwanashyaka - 2024 - Archive for Mathematical Logic 63 (3):353-390.
Algebraic proofs of cut elimination.Jeremy Avigad - manuscript
Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$ LK h.Ján Komara - 2022 - Archive for Mathematical Logic 61 (3):503-534.
Classifying material implications over minimal logic.Hannes Diener & Maarten McKubre-Jordens - 2020 - Archive for Mathematical Logic 59 (7-8):905-924.
Cut elimination by unthreading.Gabriele Pulcini - 2023 - Archive for Mathematical Logic 63 (1):211-223.
Disjunctive logic programs, answer sets, and the cut rule.Éric Martin - 2022 - Archive for Mathematical Logic 61 (7):903-937.
Normalisation and subformula property for a system of classical logic with Tarski’s rule.Nils Kürbis - 2021 - Archive for Mathematical Logic 61 (1):105-129.
Cut elimination for entailment relations.Davide Rinaldi & Daniel Wessel - 2019 - Archive for Mathematical Logic 58 (5):605-625.
A Connection Between Cut Elimination and Normalization.Mirjana Borisavljević - 2006 - Archive for Mathematical Logic 45 (2):113-148.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.

Analytics

Added to PP
2024-01-26

Downloads
17 (#873,341)

6 months
17 (#151,974)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Paolo Maffezioli
Universitat de Barcelona

Citations of this work

No citations found.

Add more citations

References found in this work

A formal system for euclid’s elements.Jeremy Avigad, Edward Dean & John Mumma - 2009 - Review of Symbolic Logic 2 (4):700--768.
Cut Elimination in the Presence of Axioms.Sara Negri & Jan Von Plato - 1998 - Bulletin of Symbolic Logic 4 (4):418-435.
Tarski's system of geometry.Alfred Tarski & Steven Givant - 1999 - Bulletin of Symbolic Logic 5 (2):175-214.
Geometrisation of first-order logic.Roy Dyckhoff & Sara Negri - 2015 - Bulletin of Symbolic Logic 21 (2):123-163.

View all 8 references / Add more references