Resolution is cut-free (Q972424): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VAMPIRE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Zenon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-009-9153-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096711734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming with Focusing Proofs in Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semantic Completeness Proof for TaMeD / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructive Cut Admissibility in Deduction Modulo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut Elimination in Deduction Modulo by Abstract Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOL-λσ: an intentional first-order expression of higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving modulo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof normalization modulo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focusing and Polarization in Intuitionistic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The predicate calculus with \(\varepsilon\)-symbol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume I / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Resolution is cut-free
scientific article

    Statements

    Resolution is cut-free (English)
    0 references
    0 references
    26 May 2010
    0 references
    The paper proves through syntactic translation that the extension of the resolution proof system to deduction modulo is equivalent to the cut-free fragment of the sequent calculus modulo. The resolution method in deduction modulo, called ENAR, is proved to be sound with respect to the cut-free fragment of sequent calculus. However, in order to prove completeness of ENAR with respect to the original sequent calculus, extra assumptions are needed. Due to the expressiveness of deduction modulo, the results obtained in this paper can be applied to higher-order resolution, Peano arithmetic and Zermelo set theory.
    0 references
    0 references
    classical sequent calculus
    0 references
    cut-free
    0 references
    cut rule
    0 references
    deduction modulo
    0 references
    ENAR
    0 references
    resolution
    0 references
    rewriting
    0 references
    Skolemization
    0 references
    Skolem theorem
    0 references
    0 references
    0 references
    0 references