Open Access. Powered by Scholars. Published by Universities.®
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees And Other Distributive Upper Semi-Lattices, Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees And Other Distributive Upper Semi-Lattices, Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Computer Science Faculty Publication Series
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is a characterization of the finite lattices which can be embedded into the r.e. wtt-degrees by a map which preserves the least and greatest elements: a finite lattice has such an embedding if and only if it is distributive and the ideal generated by its cappable elements and the filter generated by its cuppable elements are disjoint. We formulate general criteria that allow one to conclude that a distributive upper semi-lattice has a decidable two-quantifier …
Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees And Other Distributive Upper Semi-Lattices, Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees And Other Distributive Upper Semi-Lattices, Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
Peter Fejer
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is a characterization of the finite lattices which can be embedded into the r.e. wtt-degrees by a map which preserves the least and greatest elements: a finite lattice has such an embedding if and only if it is distributive and the ideal generated by its cappable elements and the filter generated by its cuppable elements are disjoint. We formulate general criteria that allow one to conclude that a distributive upper semi-lattice has a decidable two-quantifier …