Effectively inseparable Boolean algebras in lattices of sentences (Q2655144): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00153-009-0161-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987745576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding in the partial order of enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Partially Conservative Sentences and Interpretability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ∀∃ THEORY OF PEANO Σ<sub>1</sub> SENTENCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal recursion theoretic properties of r.e. preordered structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively dense Boolean algebras and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively extensible theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction-preserving "Recursive Isomorphisms" between theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability in diagonalizable algebras / rank
 
Normal rank

Latest revision as of 10:21, 2 July 2024

scientific article
Language Label Description Also known as
English
Effectively inseparable Boolean algebras in lattices of sentences
scientific article

    Statements

    Effectively inseparable Boolean algebras in lattices of sentences (English)
    0 references
    0 references
    22 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    ideal definability
    0 references
    lattices of \(\Sigma_n\) sentences
    0 references
    diagonalizable algebras
    0 references
    arithmetic theories
    0 references
    degrees of interpretability
    0 references
    0 references