Generalized quantifiers and well orderings (Q5659525): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5570212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic with the quantifier “there exist uncountably many” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grundzüge des Systemenkalküls II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness of logic with the added quantifier "there are uncountable many" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-completeness in a first order language with a generalized quantifier / rank
 
Normal rank

Latest revision as of 10:52, 12 June 2024

scientific article; zbMATH DE number 3390742
Language Label Description Also known as
English
Generalized quantifiers and well orderings
scientific article; zbMATH DE number 3390742

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references