38 search results - page 2 / 8 » Nonstandard models that are definable in models of Peano Ari... |
AML
2002
13 years 5 months ago
2002
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
APAL
2008
13 years 5 months ago
2008
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
JSYML
2007
13 years 5 months ago
2007
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
DAGSTUHL
2008
13 years 6 months ago
2008
Interval arithmetic is arithmetic for continuous sets. Floating-point intervals are intervals of real numbers with floating-point bounds. Operations for intervals can be efficient...