scholarly journals Inputs, Outputs, and Composition in the Logic of Information Flows

2020 ◽  
Author(s):  
Heba Aamer ◽  
Bart Bogaerts ◽  
Dimitri Surinx ◽  
Eugenia Ternovska ◽  
Jan Van den Bussche
Keyword(s):  
Systematic Study ◽  
General Framework ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Information Flows ◽  
First Order ◽  
Sequential Composition ◽  
Inputs And Outputs

The logic of information flows (LIF) is a general framework in which tasks of a procedural nature can be modeled in a declarative, logic-based fashion. The first contribution of this paper is to propose semantic and syntactic definitions of inputs and outputs of LIF expressions. We study how the two relate and show that our syntactic definition is optimal in a sense that is made precise. The second contribution of this paper is a systematic study of the expressive power of sequential composition in LIF. Our results on composition tie in the results on inputs and outputs, and relate LIF to first-order logic (FO) and bounded-variable LIF to bounded-variable FO.

scholarly journals Taking Plurals at Face Value

2021 ◽  
pp. 8-30
Author(s):  
Salvatore Florio ◽  
Øystein Linnebo
Keyword(s):  
Philosophy Of Mathematics ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Logical System ◽  
Plural Logic ◽  
First Order ◽  
Philosophical Significance ◽  
Pure Logic

Plural logic is a logical system in which plural terms and predicates figure as primitive expressions alongside the singular resources of ordinary first-order logic. The philosophical significance of this system depends on two of its alleged features: being pure logic and providing more expressive power than first-order logic. This chapter first introduces the language and axioms of plural logic and then analyzes this logic’s main philosophical applications in metaphysics, philosophy of mathematics, and semantics.

scholarly journals Local Normal Forms for First-Order Logic with Applications to Games and Automata

1999 ◽  
Vol Vol. 3 no. 3 ◽  
Author(s):  
Thomas Schwentick ◽  
Klaus Barthelmann
Keyword(s):  
Normal Forms ◽  
Winning Strategy ◽  
Expressive Power ◽  
Second Order ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Relational Structures ◽  
Second Order Logic ◽  
Monadic Second Order Logic

International audience Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata models are defined that have, on arbitrary classes of relational structures, exactly the expressive power of first-order logic and existential monadic second-order logic, respectively.

scholarly journals Successor-Invariant First-Order Logic on Classes of Bounded Degree (Extended Abstract)

2021 ◽  
Author(s):  
Julien Grange
Keyword(s):  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Bounded Degree ◽  
First Order ◽  
Successor Relation

We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of a successor relation on the vertices of the graph is allowed, as long as the validity of formulas is independent on the choice of a particular successor. We show that when the degree is bounded, successor-invariant first-order logic is no more expressive than first-order logic.

Minimal predicates, fixed-points, and definability

2005 ◽  
Vol 70 (3) ◽  
pp. 696-712 ◽  
Author(s):  
Johan Van Benthem
Keyword(s):  
Mathematical Logic ◽  
Fixed Points ◽  
Expressive Power ◽  
Correspondence Theory ◽  
Order Logic ◽  
First Order Logic ◽  
Technical Result ◽  
Unique Existence ◽  
First Order ◽  
Preservation Theorem

AbstractMinimal predicates P satisfying a given first-order description ϕ(P) occur widely in mathematical logic and computer science. We give an explicit first-order syntax for special first-order ‘PIA conditions’ ϕ(P) which guarantees unique existence of such minimal predicates. Our main technical result is a preservation theorem showing PIA-conditions to be expressively complete for all those first-order formulas that are preserved under a natural model-theoretic operation of ‘predicate intersection’. Next, we show how iterated predicate minimization on PIA-conditions yields a language MIN(FO) equal in expressive power to LFP(FO), first-order logic closed under smallest fixed-points for monotone operations. As a concrete illustration of these notions, we show how our sort of predicate minimization extends the usual frame correspondence theory of modal logic, leading to a proper hierarchy of modal axioms: first-order-definable, first-order fixed-point definable, and beyond.

Towards a characterization of order-invariant queries over tame graphs

2009 ◽  
Vol 74 (1) ◽  
pp. 168-186 ◽  
Author(s):  
Michael Benedikt ◽  
Luc Segoufin
Keyword(s):  
Linear Order ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Finite Graphs ◽  
Bounded Treewidth ◽  
First Order ◽  
A New Technique ◽  
Order Invariant

AbstractThis work deals with the expressive power of logics on finite graphs with access to an additional “arbitrary” linear order. The queries that can be expressed this way are the order-invariant queries for the logic. For the standard logics used in computer science, such as first-order logic, it is known that access to an arbitrary linear order increases the expressiveness of the logic. However, when we look at the separating examples, we find that they have satisfying models whose Gaifman Graph is complex – unbounded in valence and in treewidth. We thus explore the expressiveness of order-invariant queries over well-behaved graphs. We prove that first-order order-invariant queries over strings and trees have no additional expressiveness over first-order logic in the original signature. We also prove new upper bounds on order-invariant queries over bounded treewidth and bounded valence graphs. Our results make use of a new technique of independent interest: the application of algebraic characterizations of definability to show collapse results.

Epsilon-logic is more expressive than first-order logic over finite structures

2000 ◽  
Vol 65 (4) ◽  
pp. 1749-1757 ◽  
Author(s):  
Martin Otto
Keyword(s):  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Database Theory ◽  
Finite Structures

AbstractThere are properties of finite structures that are expressible with the use of Hilbert's ∈-operator in a manner that does not depend on the actual interpretation for ∈-terms. but not expressible in plain first-order. This observation strengthens a corresponding result of Gurevich, concerning the invariant use of an auxiliary ordering in first-order logic over finite structures. The present result also implies that certain non-deterministic choice constructs, which have been considered in database theory, properly enhance the expressive power of first-order logic even as far as deterministic queries are concerned, thereby answering a question raised by Abiteboul and Vianu.

The relative expressive power of some logics extending first-order logic

1979 ◽  
Vol 44 (2) ◽  
pp. 129-146 ◽  
Author(s):  
John Cowles
Keyword(s):  
Model Theory ◽  
Expressive Power ◽  
Second Order ◽  
Order Logic ◽  
The Other ◽  
First Order Logic ◽  
Finite Sets ◽  
Limited Ability ◽  
First Order ◽  
Second Order Logic

In recent years there has been a proliferation of logics which extend first-order logic, e.g., logics with infinite sentences, logics with cardinal quantifiers such as “there exist infinitely many…” and “there exist uncountably many…”, and a weak second-order logic with variables and quantifiers for finite sets of individuals. It is well known that first-order logic has a limited ability to express many of the concepts studied by mathematicians, e.g., the concept of a wellordering. However, first-order logic, being among the simplest logics with applications to mathematics, does have an extensively developed and well understood model theory. On the other hand, full second-order logic has all the expressive power needed to do mathematics, but has an unworkable model theory. Indeed, the search for a logic with a semantics complex enough to say something, yet at the same time simple enough to say something about, accounts for the proliferation of logics mentioned above. In this paper, a number of proposed strengthenings of first-order logic are examined with respect to their relative expressive power, i.e., given two logics, what concepts can be expressed in one but not the other?For the most part, the notation is standard. Most of the notation is either explained in the text or can be found in the book [2] of Chang and Keisler. Some notational conventions used throughout the text are listed below: the empty set is denoted by ∅.

Beth’s theorem and Craig’s theorem

2018 ◽  
Author(s):  
Zeno Swijtink
Keyword(s):  
Sufficient Conditions ◽  
Predicate Symbol ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Infinite Length ◽  
First Order ◽  
Explicit Definition ◽  
Central Result ◽  
Definition Of

Beth’s theorem is a central result about definability of non-logical symbols in classical first-order theories. It states that a symbol P is implicitly defined by a theory T if and only if an explicit definition of P in terms of some other expressions of the theory T can be deduced from the theory T. Intuitively, the symbol P is implicitly defined by T if, given the extension of these other symbols, T fixes the extension of the symbol P uniquely. In a precise statement of Beth’s theorem this will be replaced by a condition on the models of T. An explicit definition of a predicate symbol states necessary and sufficient conditions: for example, if P is a one-place predicate symbol, an explicit definition is a sentence of the form (x) (Px ≡φ(x)), where φ(x) is a formula with free variable x in which P does not occur. Thus, Beth’s theorem says something about the expressive power of first-order logic: there is a balance between the syntax (the deducibility of an explicit definition) and the semantics (across models of T the extension of P is uniquely determined by the extension of other symbols). Beth’s definability theorem follows immediately from Craig’s interpolation theorem. For first-order logic with identity, Craig’s theorem says that if φ is deducible from ψ, there is an interpolant θ, a sentence whose non-logical symbols are common to φ and ψ, such that θ is deducible from ψ, while φ is deducible from θ. Craig’s theorem and Beth’s theorem also hold for a number of non-classical logics, such as intuitionistic first-order logic and classical second-order logic, but fail for other logics, such as logics with expressions of infinite length.

scholarly journals SOME MODEL THEORY OF GUARDED NEGATION

2018 ◽  
Vol 83 (04) ◽  
pp. 1307-1344
Author(s):  
VINCE BÁRÁNY ◽  
MICHAEL BENEDIKT ◽  
BALDER TEN CATE
Keyword(s):  
Modal Logic ◽  
Model Theory ◽  
Description Logics ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Beth Definability ◽  
Order Translations ◽  
Certain Answers

AbstractThe Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In this article we study the model theory of GNFO formulas. Our results include effective preservation theorems for GNFO, effective Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to a large class of GNFO sentences within very restricted logics.

scholarly journals Expressive Power of Abstract Meaning Representations

2016 ◽  
Vol 42 (3) ◽  
pp. 527-535 ◽  
Author(s):  
Johan Bos
Keyword(s):  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Simple Extension ◽  
Universal Quantifier ◽  
Proper Treatment ◽  
First Order ◽  
Current Definition ◽  
Universal Quantification ◽  
Definition Of

The syntax of abstract meaning representations (AMRs) can be defined recursively, and a systematic translation to first-order logic (FOL) can be specified, including a proper treatment of negation. AMRs without recurrent variables are in the decidable two-variable fragment of FOL. The current definition of AMRs has limited expressive power for universal quantification (up to one universal quantifier per sentence). A simple extension of the AMR syntax and translation to FOL provides the means to represent projection and scope phenomena.

Sign in / Sign up

Export Citation Format

Share Document