27 search results - page 3 / 6 » The Modal Formula (...) Is Not First-Order Definable |
FROCOS
2000
Springer
15 years 1 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
JAR
2010
14 years 4 months ago
2010
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
CP
2000
Springer
15 years 1 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
JSYML
2008
14 years 9 months ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
NDJFL
2002
14 years 9 months ago
2002
In any nonstandard model of Peano arithmetic, the standard part is not first order definable. But we show that in some model the standard part is definable as the unique solution ...