Related papers: Three Variables Suffice for Real-Time Specificatio…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
We find, motivated by real-world applications, that the well-known request-response specification comes with multiple variations, and that these variations should be distinguished. As the first main contribution, we introduce a…
The canonical formalism of three dimensional gravity coupled with the Dirac field is considered. We introduce complex variables to simplify the Dirac brackets of canonical variables and examine the canonical structure of the theory. We…
We consider an analyst whose goal is to identify a subject's utility function through revealed preference analysis. We argue the analyst's preference about which experiments to run should adhere to three normative principles: The first,…
We find a choice of variables for the 3+1 formulation of general relativity which casts the evolution equations into (flux-conservative) symmetric-hyperbolic first order form for arbitrary lapse and shift, for the first time. We redefine…
We set up a framework for a model-independent analysis of the time variation of $e$, $\hbar$, and $c$ indiviually. It is shown that the time-evolution of each constant can be determined uniquely from the time evolution of the fine structure…
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…
It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…
This paper establishes model-theoretic properties of $\mathrm{FOE}^{\infty}$, a variation of monadic first-order logic that features the generalised quantifier $\exists^\infty$ (`there are infinitely many'). We provide syntactically defined…
Architectural imperatives due to the slowing of Moore's Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness.…
Relational properties describe multiple runs of one or more programs. They characterize many useful notions of security, program refinement, and equivalence for programs with diverse computational effects, and they have received much…
Causality and stability are fundamental requirements for the differential equations describing predictable relativistic many-body systems. In this work, we investigate the stability and causality criteria in linear mode analysis. We discuss…
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…
In this paper, we construct an undecidable 3-variable superintuitionistic propositional calculus, i.e., a finitely axiomatizable extension of the intuitionistic propositional calculus with axioms containing only 3 variables. Since there are…
This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers…
In this paper we consider function $f(x)={x+a\over bx+c}$, (where $b\ne 0$, $c\ne ab$, $x\ne -{c\over b}$) on three fields: the set of real, $p$-adic and complex numbers. We study dynamical systems generated by this function on each field…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
We prove that the positive fragment of first-order intuitionistic logic in the language with two variables and a single monadic predicate letter, without constants and equality, is undecidable. This holds true regardless of whether we…
We advocate an alternative description of canonical gravity in 3+1 dimensions, obtained by using as the basic variable a real variant of the usual Ashtekar connection variables on the spatial three-manifold. With this ansatz, no non-trivial…