A typed resolution principle for deduction with conditional typing theory (Q1855225): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ML / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-resolution theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Matrices with Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resolution principle for a logic with restricted quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more expressive formulation of many sorted logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear resolution with selection function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating dublication with the hyper-linking strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Theorem-Proving by Model Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic backward chaining proof system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Horn clause logic programming without contrapositives / 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: Using sophisticated models in resolution theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of an order-sorted logic with term declarations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated deduction by theory resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mechanical solution of Schubert's steamroller by many-sorted resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency and Completeness of the Set of Support Strategy in Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296171 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 5 June 2024

scientific article
Language Label Description Also known as
English
A typed resolution principle for deduction with conditional typing theory
scientific article

    Statements

    A typed resolution principle for deduction with conditional typing theory (English)
    0 references
    0 references
    4 February 2003
    0 references
    0 references