38 search results - page 4 / 8 » Nonstandard models that are definable in models of Peano Ari... |
VRML
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, a function-based extension of Extensible 3D (X3D) is proposed. The extension allows authors to use analytical functions to define geometry, color, 3D texture as wel...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
COMPUTING
2006
13 years 7 months ago
2006
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
APAL
2010
13 years 7 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
CC
2001
Springer
14 years 3 days ago
2001
Springer
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...