Sciweavers

23 search results - page 4 / 5
» aml 2010
Sort
View
AML
2010
99views more  AML 2010»
14 years 10 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
AML
2010
118views more  AML 2010»
14 years 10 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
90
Voted
AML
2010
88views more  AML 2010»
14 years 10 months ago
Relativized Schnorr tests with universal behavior
A Schnorr test relative to some oracle A may informally be called "universal" if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cann...
Nicholas Rupprecht
AML
2010
96views more  AML 2010»
14 years 10 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
71
Voted
AML
2010
80views more  AML 2010»
14 years 10 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