Intuitionistic fixed point logic (Q2220485): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Copatterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretation and inductive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Coinductive Proofs to Exact Real Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From coinductive proofs to exact real arithmetic: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Non-Deterministic Concurrent Programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized program extraction for induction and coinduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs, programs, processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of equality for codata types / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coinductive approach to computing with compact sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Gray-code Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Prawf}: an interactive proof system for program extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic view of computational adequacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract data type for real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction-recursion and initial algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCF extended with real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General logical metatheorems for functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Lattices and Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proof-theoretic strength of monotone induction in explicit mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5718566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interpretation of intuitionistic number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some logical metatheorems with applications in functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Proof Theory: Proof Interpretations and Their Use in Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed lambda-calculus in classical Zermelo-Fraenkel set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent choice, `quote' and the clock / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Relational Models of Typed Lambda-Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ideal model for recursive polymorphic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive types and type constraints in the second-order lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive-Inductive Definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3532205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-theoretical and other elementary models of the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramified Corecurrence and Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5718561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational adequacy for recursive types in models of intuitionistic set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / 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: Real number computation through Gray code embedding. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real number computation with committed choice logic programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intuitionistic strength of monotone inductive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141916 / rank
 
Normal rank

Revision as of 09:16, 24 July 2024

scientific article
Language Label Description Also known as
English
Intuitionistic fixed point logic
scientific article

    Statements

    Intuitionistic fixed point logic (English)
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    proof theory
    0 references
    realizability
    0 references
    program extraction
    0 references
    induction
    0 references
    coinduction
    0 references
    exact real number computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references