1943 search results - page 110 / 389 » Ordering Default Theories |
102
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
102
Voted
ENTCS
2002
14 years 11 months ago
2002
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
116
click to vote
DM
2011
14 years 3 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
127
click to vote
AISC
2010
Springer
15 years 3 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...