Sciweavers

AML
2010
64views more  AML 2010»
13 years 11 months ago
An ordinal analysis for theories of self-referential truth
Graham Emil Leigh, Michael Rathjen
AML
2010
91views more  AML 2010»
13 years 11 months ago
The limitations of cupping in the local structure of the enumeration degrees
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 ...
Mariya Ivanova Soskova
AML
2010
96views more  AML 2010»
13 years 11 months ago
Implicational (semilinear) logics I: a new hierarchy
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...
Petr Cintula, Carles Noguera
AML
2010
118views more  AML 2010»
13 years 11 months ago
The modal logic of continuous functions on the rational numbers
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...
Philip Kremer
AML
2010
80views more  AML 2010»
13 years 11 months ago
Goodness in the enumeration and singleton degrees
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...
Charles M. Harris
AML
2010
102views more  AML 2010»
13 years 11 months ago
The basic theory of infinite time register machines
Merlin Carl, Tim Fischbach, Peter Koepke, Russell ...
AML
2010
55views more  AML 2010»
13 years 11 months ago
Quotients of Boolean algebras and regular subalgebras
Bohuslav Balcar, T. Pazák
AML
2010
86views more  AML 2010»
13 years 11 months ago
Finding generic filters by playing games
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...
Heike Mildenberger
AML
2010
104views more  AML 2010»
13 years 11 months ago
Degrees of categoricity of computable structures
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...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
AML
2010
99views more  AML 2010»
13 years 11 months ago
Effectively inseparable Boolean algebras in lattices of sentences
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...
V. Yu. Shavrukov