English
Related papers

Related papers: Hierarchies in independence logic

200 papers

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all…

Logic in Computer Science · Computer Science 2013-03-11 Arnaud Durand , Johannes Ebbing , Juha Kontinen , Heribert Vollmer

We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…

Logic in Computer Science · Computer Science 2019-02-26 Miika Hannula , Åsa Hirvonen , Juha Kontinen , Vadim Kulikov , Jonni Virtema

Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…

Logic · Mathematics 2020-01-22 Fan Yang

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…

Logic · Mathematics 2025-02-05 Matthew Harrison-Trainor , Miles Kretschmer

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

We propose a semantic foundation for logics for reasoning in settings that possess a distinction between equality of variables, a coarser equivalence of variables, and a notion of conditional independence between variables. We show that…

Logic in Computer Science · Computer Science 2026-05-18 Alex Simpson

We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.

Logic · Mathematics 2010-01-19 Dov Null Gabbay , Karl Schlechta

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Formal Languages and Automata Theory · Computer Science 2015-12-01 Théo Pierron , Thomas Place , Marc Zeitoun

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

We continue the work on the relations between independence logic and the model-theoretic analysis of independence, generalizing the results of [15] and [16] to the framework of abstract independence relations for an arbitrary AEC. We give a…

Logic · Mathematics 2016-09-09 Gianluca Paolini

We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…

Logic in Computer Science · Computer Science 2021-09-27 Pietro Galliani , Jouko Väänänen

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a…

Logic in Computer Science · Computer Science 2024-04-08 Emanuel Kieronski , Antti Kuusisto

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Logic · Mathematics 2021-12-09 Rob Egrot

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

Logic in Computer Science · Computer Science 2021-04-12 Miika Hannula , Minna Hirvonen , Juha Kontinen