Related papers: 0-1 laws
Reflecting our experiences in areas, like Algebraic Specifications, Abstract Model Theory, Graph Transformations, and Model Driven Software Engineering (MDSE), we present a general, category independent approach to Logics of First-Order…
We discuss matching control laws for underactuated systems. We previously showed that this class of matching control laws is completely charactarized by a linear system of first order partial differential equations for one set of variables…
We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is…
A first order inference system, called R-calculus, is defined to develop the specifications. It is used to eliminate the laws which is not consistent with the user's requirements. The R-calculus consists of the structural rules, an axiom, a…
The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…
The dynamics of the second order rational difference equation $\displaystyle{z_{n+1}=\frac{\alpha + z_{n-1}}{\beta z_n + z_{n-1}}}$ with the real parameter $\alpha$, $\beta$ and arbitrary non-negative real initial conditions is investigated…
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a…
The celebrated theorem of Komlos asserts that L1-boundedness is sufficient for a given sequence of functions to contain a subsequence along which (in a "lacunary" manner), and along whose every further subsequence ("hereditarily"), a strong…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
A general information-theoretic framework for deriving physical laws is presented and a principle of informational physics is enunciated within its context. Existing approaches intended to derive physical laws from information-theoretic…
We analyse so-called computable laws, i.e., laws that can be enforced by automatic procedures. These laws should be logically perfect and unambiguous, but sometimes they are not. We use a regulation on road transport to illustrate this…
We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…
In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can…
To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on procedural questions. This would enable an account of…
Complex systems theory pays much attention to simple mechanisms producing nontrivial patterns, especially power laws. However, power laws with exponent close to one also result from complex mixtures of mechanisms that, in isolation, would…