Duality, non-standard elements, and dynamic properties of r.e. sets

DOI10.1016/j.apal.2015.10.004zbMath1403.03066OpenAlexW2170524029MaRDI QIDQ2630829

V. Yu. Shavrukov

Publication date: 22 July 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/275868

zbMATH Keywords

index setsrecursively enumerable setslattice of recursively enumerable setsduality for distributive latticesnon-standard models of arithmetic

Mathematics Subject Classification ID

Lattices and duality (06D50) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

R.e. Prime powers and total rigidity

Cites Work

• Fine hierarchies via Priestley duality
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Splitting properties and jump classes
• End extensions of models of arithmetic
• Forcing, arithmetic, division rings
• Models of arithmetic and recursive functions
• Enumeration reducibilities
• Definable properties of the computably enumerable sets
• An extension theorem for sober spaces and the Goldman topology
• The elementary theory of recursively enumerable sets
• Some Stone spaces and recursion theory
• A theorem on partial conservativity in arithmetic
• Partially Conservative Extensions of Arithmetic
• Recursively saturated nonstandard models of arithmetic; addendum
• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• Recursively enumerable generic sets
• On models of arithmetic—Answers to two problems raised by H. Gaifman
• Ordered Topological Spaces and the Representation of Distributive Lattices
• Descending sequences of degrees
• Some problem in elementary arithmetics
• Determining Automorphisms of the Recursively Enumerable Sets
• Diagonals and -maximal sets
• Iterated Quotients of the Lattice of Recursively Enumerable Sets
• On the Lattice of Recursively Enumerable Sets
• THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES
• Monadic Elementary Formal Systems
• Injecting inconsistencies into models of PA
• On the filter of computably enumerable supersets of an r-maximal set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality, non-standard elements, and dynamic properties of r.e. sets