Semantical completeness of first-order predicate logic and the weak fan theorem (Q2350974): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Formal systems for some branches of intuitionistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitionistic completeness theorem for classical predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalents of the (weak) fan theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another intuitionistic completeness proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism in mathematics. An introduction. Volume I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitiomstic completeness theorem for intuitionistic predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brouwer’s Approximate Fixed-Point Theorem is Equivalent to Brouwer’s Fan Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative / rank
 
Normal rank

Latest revision as of 08:53, 10 July 2024

scientific article
Language Label Description Also known as
English
Semantical completeness of first-order predicate logic and the weak fan theorem
scientific article

    Statements

    Identifiers