Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally (Q2254574): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CafeOBJ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CASL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11787-013-0090-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012962349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omitting types for algebraizable extensions of first order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omitting types for finite variable fragments and complete representations of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Omitting Types Theorem for first order logic with infinitary relation symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: CASL: the Common Algebraic Specification Language. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An institution-independent proof of the Robinson consistency theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birkhoff completeness in institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating CASL with other specification languages: the institution level. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category-based constraint logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An institution-independent proof of Craig interpolation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary Diagrams in Institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrand theorems in arbitrary institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A categorical study on the finiteness of specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Institution-independent model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical foundations of CafeOBJ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Institutions: abstract model theory for specification and programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Oxford survey of order sorted algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Institution morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness by Forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Institution-independent Generalization of Tarski's Elementary Chain Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in the theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the concept of <i>ω</i>-consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>ω</i>-consistency and related properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Institutional Version of Gödel’s Completeness Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Beth definability in institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of free models in abstract algebraic institutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-varieties in abstract algebraic institutions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 9 July 2024

scientific article
Language Label Description Also known as
English
Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
scientific article

    Statements

    Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally (English)
    0 references
    0 references
    5 February 2015
    0 references
    institution
    0 references
    model theoretic forcing
    0 references
    downward Löwenheim-Skolem theorem
    0 references
    omitting types theorem
    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