Kripke models for classical logic (Q636371): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Typed Applicative Structures and Normalization by Evaluation for System F ω / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic proofs of cut elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krivine's intuitionistic proof of classical completeness (for countable languages) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The duality of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of classical models by means of Kripke models (Survey) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational isomorphisms in classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on isomorphisms in typed lambda calculi with empty and sum types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weak completeness of intuitionistic predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem in modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theorems of Gödel and Kreisel: Completeness and Markov's principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic completeness and classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitiomstic completeness theorem for intuitionistic predicate logic / rank
 
Normal rank

Revision as of 09:48, 4 July 2024

scientific article
Language Label Description Also known as
English
Kripke models for classical logic
scientific article

    Statements

    Kripke models for classical logic (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2011
    0 references
    Kripke model
    0 references
    classical logic
    0 references
    sequent calculus
    0 references
    lambda-mu calculus
    0 references
    classical realizability
    0 references
    normalization by evaluation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers