AML
2010
13 years 5 months ago
2010
AML
2010
13 years 5 months ago
2010
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...
AML
2010
13 years 5 months ago
2010
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
AML
2010
13 years 5 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
AML
2010
13 years 5 months ago
2010
We investigate and extend the notion of a good approximation with respect to the enumeration (De) and singleton (Ds) degrees. We refine two results by Griffith, on the inversion of...
AML
2010
13 years 5 months ago
2010
AML
2010
13 years 5 months ago
2010
AML
2010
13 years 5 months ago
2010
We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that (2, [], is almost constant on) together with CH and "all Aronsza...
AML
2010
13 years 5 months ago
2010
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
AML
2010
13 years 5 months ago
2010
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...