EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Universal Computably Enumerable Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence relations induced by extensional formulae: classification by means of a new fixed point property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity in generations of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism relations on computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive Sublattices of a Free Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs realised by r.e. equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibilities among equivalence relations induced by recursively enumerable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Positive Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively precomplete numerations and arithmetic / 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: Q3690803 / 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: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction-preserving "Recursive Isomorphisms" between theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Uniformly Finitely Precomplete Positive Equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively inseparable Boolean algebras in lattices of sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform density in Lindenbaum algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical number theory I. An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completenes principle: A study of provability in heyting's arithmetic and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:05, 27 July 2024

scientific article; zbMATH DE number 7469707
Language Label Description Also known as
English
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
scientific article; zbMATH DE number 7469707

    Statements

    EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (English)
    0 references
    0 references
    0 references
    7 February 2022
    0 references
    0 references
    computable reducibility on preorders
    0 references
    effective inseparability
    0 references
    uniform finite precompleteness
    0 references
    uniform density
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references