Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Effective Scopes and Linear Patterns
General Regularization Procedure
Conclusions
References
All Topics
Mathematics
Pure Mathematics

Independence-friendly logic without Henkin quantification

Profile image of Lauri HellaLauri Hella

2021, Archive for Mathematical Logic

https://doi.org/10.1007/S00153-021-00781-8
visibility

…

description

51 pages

link

1 file

Abstract

We analyze the expressive resources of IF logic that do not stem from Henkin (partiallyordered) quantification. When one restricts attention to regular IF sentences, this amounts to the study of the fragment of IF logic which is individuated by the gametheoretical property of action recall (AR). We prove that the fragment of prenex AR sentences can express all existential second-order properties. We then show that the same can be achieved in the non-prenex fragment of AR, by using "signalling by disjunction" instead of Henkin or signalling patterns. We also study irregular IF logic (in which requantification of variables is allowed) and analyze its correspondence to regular IF logic. By using new methods, we prove that the game-theoretical property of knowledge memory is a first-order syntactical constraint also for irregular sentences, and we identify another new first-order fragment. Finally we discover that irregular prefixes behave quite differently in finite and infinite models. In particular, we show that, over infinite structures, every irregular prefix is equivalent to a regular one; and we present an irregular prefix which is second order on finite models but collapses to a first-order prefix on infinite models.

Related papers

On first-order conditional logics
James Delgrande

Artificial Intelligence, 1998

Conditional logics have been developed as a basis from which to investigate logical properties of "weak" conditionals representing, for example, counterfactual and default assertions. This work has largely centred on propositional approaches. However, it is clear that for a full account a first-order logic is required. Existing or obvious approaches to first-order conditional logics are inadequate; in particular, various representational issues in default reasoning are not addressed by extant approaches. Further, these problems are not unique to conditional logic, but arise in other nonmonotonic reasoning formalisms. I argue that an adequate first-order approach to conditional logic must admit domains that vary across possible worlds; as well the most natural expression of the conditional operator binds variables (although this binding may he eliminated by definition). A possible worlds approach based on Kripke structures is developed, and it is shown that this approach resolves various problems that arise in a first-order setting, including specificity arising from nested quantifiers in a formula and an analogue of the lottery paradox that arises in reasoning about default properties. 0 1998 Published by Elsevier Science B.V. All rights reserved.

View PDFchevron_right
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
Santiago Figueira

Journal of Computer and System Sciences, 2014

It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ 1 1) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆ 1 2. In this article we consider SL(↓), IF-logic extended with Hodges' flattening operator ↓, which allows to define a classical negation. Furthermore, this negation, in Hodges' style, may occur also under the scope of IF quantifiers. SL(↓) contains Extended IF-logic and hence it is at least as expressive as the Boolean closure of Σ 1 1. We prove that SL(↓) corresponds to a weak syntactic fragment of SO which we show to be strictly contained in ∆ 1 2. The separation is derived almost trivially from the fact that Σ 1 n defines its own truth-predicate. We finally show that SL(↓) is equivalent to the logic of Henkin quantifiers, which shows, we argue, that Hodges' notion of negation is adequate.

View PDFchevron_right
Axiomatizing first-order consequences in dependence logic
Juha Kontinen, Jouko Väänänen

Annals of Pure and Applied Logic, 2013

Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem. We give the necessary preliminaries about dependence logic in the next section, but let us for now accept that θ 1 is true in a model if and only if the domain of the model is infinite. The player who picks y has to pick a different y for different x. Although dependence logic does not have a negation in the sense of classical logic, the mere existence of θ 1 in dependence logic should give a hint that axiomatization is going to be a problem. Elaborating but a little, θ 1 can be turned into a sentence θ 2 in the language of arithmetic which says that some elementary axioms of number theory fail or else some number has infinitely many predecessors. We can now prove that a first-order sentence φ of the language of arithmetic is true in (N, +, ×, <) if and only if θ 2 ∨ φ is logically valid (true in every model) in dependence logic. This can be seen as follows: Suppose first φ is true in (N, +, ×, <). Let us take an arbitrary model M of the language of arithmetic. If M |= θ 2 , we may conclude M |= Θ 2 ∨ φ. So let us assume M |= θ 2 . Thus M satisfies the chosen elementary axioms of number theory and every element has only finitely many predecessors. As a consequence, M ∼ = (N, +, ×, <), so M |= φ, and again M |= θ 2 ∨ φ. For the converse, suppose θ 2 ∨ φ is logically valid. Since (N, +, ×, <) fails to satisfy θ 2 , we must conclude that φ is true in (N, +, ×, <).

View PDFchevron_right
Finite information logic
Jouko Väänänen

Annals of Pure and Applied Logic, 2005

We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the ∃ player) is restricted to a finite amount of information about Abelard's (∀'s) moves. This logic is shown to be equivalent to a sublogic ∃∀ of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to ∃∀ logic.

View PDFchevron_right
IF and Epistemic Action Logic
Manuel Rebuschi

The Age of Alternative Logics, 2006

This paper is a tentative discussion about the alleged opposition between van Benthem's account of logic games (Epistemic Action Logic, EAL) and Hintikka's IF first-order logic. Both logics provide a specific viewpoint on the relationship between logic and games, especially games of imperfect information. Arguing for a cooperative vs. competitive strategy, we will combine EAL and IF logic and obtain natural formulations of the existence of a uniform winning strategy for the verifier in an evaluation game. One of the upshots of the combination IF-EAL is a well known result usually put forward about IF-languages, namely that a sentence is equivalent to its truth-conditions, formulated in a new frame.

View PDFchevron_right
Henkin quantifiers and the definability of truth
Gabriel Sandu

Journal of Philosophical Logic, 2000

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L 1 * (H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L 1 * (H) with respect to Boolean operations, and obtain the language L 1 (H). At the next level, we consider an extension L 2 * (H) of L 1 (H) in which every sentence is an L 1 (H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)definability of truth-inN for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996).

View PDFchevron_right
On A New Semantics for First-Order Predicate Logic
Johan van Benthem

Journal of Philosophical Logic

View PDFchevron_right
Fragments of Monadic Second-Order Logics Over Word Structures
Hachaichi Yassine

Electronic Notes in Theoretical Computer Science, 2005

In this paper, we explore the expressive power of fragments of monadic second-order logic enhanced with some generalized quantifiers of comparison of cardinality over finite word structures. The full monadic second-order fragment of the logics that we study correspond to the famous linear hierarchy, see , and their existential fragments characterize some sequential recognizers. We prove that the first-order closure of the existential fragments of these logics is strictly beyond the existential fragments.

View PDFchevron_right
Independence-Friendly Logic and Games of Incomplete Information
Ahti Pietarinen

The Age of Alternative Logics, 2006

Of late, studies on Independence-Friendly (IF) logics have amply burgeoned. 1 The purpose in the present paper is not to provide an exposition of what such logics are or what may be done with them, but to extend the core idea behind 'IFing' different logics to cover an entirely new domain. Whereas formulas of IF logics have thus far been associated with semantic games of imperfect information, and hence capture the idea of informational independence between quantifiers and connectives (the independence in question referring to the concealment of information transmitted in the game), I will suggest quite another kind of independence. The expressions of the ensuing system are, unlike in traditional IF logics, associated with games in which the players have restricted information concerning aspects of the formal structure of the game itself.

View PDFchevron_right
First-order logic with imperfect information
Gabriel Sandu
View PDFchevron_right

References (28)

  1. Barbero, F.: On existential declarations of independence in IF logic. Rev. Symb. Log. 6, 254-280 (2013)
  2. Barbero, F.: Complexity of syntactical tree fragments of independence-friendly logic. Ann. Pure Appl. Log. 172(1), 102859 (2021)
  3. Barbero, F., Hella, L., Rönnholm, R.: Independence-friendly logic without Henkin quantification. In: Kennedy, J., de Queiroz, R. (eds.) International Workshop on Logic, Language, Information, and Computation, pp. 14-30. Springer (2017)
  4. Caicedo, X., Dechesne, F., Janssen, T.M.V.: Equivalence and quantifier rules for logic with imperfect information. Log. J. IGPL 17, 91-129 (2009)
  5. Caicedo, X., Krynicki, M.: Quantifiers for reasoning with imperfect information and 1 1 -logic. In:
  6. I.M.L.O., Carnielli, W.A. (eds.) Contemporary Mathematics, vol. 235, pp. 17-31. American Mathe- matical Society, Providence (1999)
  7. Cameron, P., Hodges, W.: Some combinatorics of imperfect information. J. Symb. Log. 66, 673-684 (2001)
  8. Dahlhaus, E.: Reduction to NP-complete problems by interpretations. In: Proceedings of the Sym- posium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity, pp. 357-365 (1983)
  9. Dechesne, F.: Game, set, maths: formal investigations into logic with imperfect information. Ph.D. thesis, Tilburg University, Tilburg (2005)
  10. Enderton, H.B.: Finite partially ordered quantifiers. Math. Log. Q. 16(8), 393-397 (1970)
  11. Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (eds.)Complexity of Computation, SIAM-AMS Proceedings, vol. 7, pp. 27-41 (1974)
  12. Grandjean, E.: First-order spectra with one variable. J. Comput. Syst. Sci. 40, 136-153 (1990)
  13. Henkin, L.: Some remarks on infinitely long formulas. In: Bernays. P. (ed.) Infinitistic Methods, pp. 167-183. Pergamon Press, London (1961)
  14. Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Fenstad, J.E., et al. (eds.) Logic, Methodology and Philosophy of Science VIII, pp. 571-589. Elsevier, Amsterdam (1989)
  15. Hodges, W.: Compositional semantics for a language of imperfect information. Log. J. IGPL 5, 539- 563 (1997)
  16. Hodges, W.: Some strange quantifiers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. Lecture Notes in Computer Science, vol. 1261, pp. 51-65. Springer, London (1997)
  17. Hyttinen, T., Tulenheimo, T.: Decidability of IF modal logic of perfect recall. Adv. Modal Log. 5, 111-131 (2005)
  18. Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York (1999)
  19. Janssen, T.M.V.: Independent choices and the interpretation of IF logic. J. Log. Lang. Inf. 11, 367-387 (2002)
  20. Janssen, T.M.V., Dechesne, F.: Signalling in IF games: a tricky business. In: Van Benthem, J., Heinz- mann, G., Rebuschi, M., Visser, H. (eds.) The Age of Alternative Logics, pp. 221-241. Springer, New York (2006)
  21. Krynicki, M.: Hierarchies of partially ordered connectives and quantifiers. Math. Log. Q. 39, 287-294 (1993)
  22. Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, New York (2004). https://doi.org/10.1007/978-3-662-07003-1
  23. Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic-A Game-Theoretic Approach, London Mathematical Society Lecture Note Series, vol. 386. Cambridge University Press, Cambridge (2011)
  24. Mostowski, M.: The relational semantics for branched quantifiers. In: Skordev, D.G. (ed.) Mathematical Logic and Its Applications, pp. 315-322. Springer, New York (1987)
  25. Sevenster, M.: Branches of imperfect information: logic, games, and computation. Ph.D. thesis, ILLC, Universiteit van Amsterdam (2006)
  26. Sevenster, M.: Dichotomy result for independence-friendly prefixes of generalized quantifiers. J. Symb. Log. 79(04), 1224-1246 (2014)
  27. Väänänen, J.: Dependence Logic: A New Approach to Independence Friendly Logic, London Mathe- matical Society Student Texts, vol. 70. Cambridge University Press, Cambridge (2007)
  28. Virtema, J.: Approaches to finite variable dependence: expressiveness and computational complexity. Ph.D. thesis, University of Tampere (2014)

Related papers

On the formal semantics of IF-like logics
Santiago Figueira

Journal of Computer and System Sciences, 2010

In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges' slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics.

View PDFchevron_right
A remark on nondeterminacy in IF logic
Jouko Väänänen

2006

A sentence of IF-logic is nondetermined in a model if neither player has a winning strategy in the two-player semantic game on that model. It is well-known that there are sentences 1 of IF-logic that are nondetermined in every model with at least two elements. In fact, only the first-order definable sentences of IF-logic are determined in all models. 2 Thus every non first-order IF-sentence is nondetermined in some models. In this paper we take a closer look at some familiar examples of sentences of IF-logic and models in which they are determined. It turns out that if we want to use the familiar examples of IF-sentences to characterize well-known mathematical structures, we observe that the relevant IF-sentences are nondetermined in exactly the standard * This paper is based on a talk in the seminar "Logic and games" of Rohit Parikh in the Graduate Center of CUNY, July 2001. /x(x = y).

View PDFchevron_right
Independendly-Friendly Logic: Dependence and Independence of Quantifiers in Logic
Gabriel Sandu

Philosophy Compass, 2012

Independence-Friendly logic (IF-logic) introduced by Hintikka and Sandu (1989) studies patterns of dependence and independence of quantifiers which exceed those found in ordinary first-order logic. The present survey focuses on the game-theoretical interpretation of IF-logic, including connections to solution concepts (equilibria in mixed strategies) in classical game theory, but we shall also present its compositional interpretation together with its connections to notions of dependence and dependence between terms.

View PDFchevron_right
Logic and Games on Automatic Structures
Łukasz Kaiser

Citeseer

The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it false. This correspondence is exploited algorithmically to evaluate formulas of first and second-order logic on finite structures. We extend the game-based algorithmic approach to first-order logic on infinite structures that arise in computer science. Such structures are stored and manipulated by a computer, thus elements and relations must be represented in a finite way. We study a prominent class of finitely presentable structures, namely automatic structures. Automatic structures consist of elements represented by words over a finite alphabet. Relations within these structures are represented by synchronous automata that perform step-by-step transitions on tuples of symbols from the alphabet. A prominent example of an automatic structure is Presburger arithmetic, for which the natural way of writing numbers as sequences of digits and the standard column addition method constitute an automatic presentation. An important property of automatic structures is that first-order logic is decidable on these structures. To develop the correspondence between games and logic on automatic structures, we first look for suitable extensions of first-order logic that remain decidable. We study the notion of game quantification and extend the notions of open and closed game quantifiers, introduced in the model theory of infinitary logics, to a regular game quantifier. We show that this game quantifier preserves regularity on automatic presentations and investigate its expressive power. We identify the classes of structures on which first-order logic extended with this quantifier collapses to pure first-order logic. For better understanding of the classes where this is not the case, we introduce the notion of inductive automorphisms and show that they preserve relations defined using the game quantifier. Model-checking games for the above extension of first-order logic can be defined in a more natural way than for pure first-order logic. Towards this, we extend the classical two-player parity games to a multiplayer setting where two coalitions play against each other with a particular kind of hierarchical imperfect information about actions of the players. In contrast to the classical case, in hierarchical games it is essential that players alternate. We show that otherwise the problem which coalition wins a hierarchical game is undecidable. Nevertheless, there is an important aspect in which they are similar to classical games: hierarchical games are robust with respect to changes of the representation of winning condition. One reason for this robustness of hierarchical games is that only a finite memory is needed to reduce games with complex winning conditions to games with simpler ones. While this technique has been well-known for games with finitely many priorities, our approach is the first to extend it to games with infinitely many priorities on infinite arenas. We generalize the classical notion of latest appearance record to a new memory structure, which we show to be sufficient for winning Muller games with a finite or co-finite number of sets in the Muller condition, and additionally for a few other classes of games with infinitely many priorities. Certain classes of winning conditions on infinitely many priorities admit descriptions in terms of generalized Zielonka trees. We investigate such conditions and show that the correspondence between the number of branches of a Zielonka tree and the memory needed for strategies generalizes to the case of infinitely many priorities. A basic way of extending first-order logic is by adding generalized Lindström quantifiers. We address the following question: which generalized unary quantifiers can be added to first-order logic without introducing non-regular relations on automatic structures. We answer this question by giving a complete characterization of such quantifiers in terms of definability using cardinality and modulo counting quantifiers. We show that these quantifiers indeed preserve regularity on all automatic structures, including the non-injective omega-automatic ones. As a corollary we answer a question of Blumensath and prove that all countable omega-automatic structures are in fact finite-word automatic. Further, we study cardinality quantifiers on a large class of generalized-automatic structures. We use the composition method for monadic second-order logic to show that on such structures cardinality quantifiers collapse to first-order logic.

View PDFchevron_right
Model-checking games for logics of imperfect information
Erich Grädel

Theoretical Computer Science, 2013

Logics of dependence and independence have semantics that, unlike Tarski semantics, are not based on single assignments (mapping variables to elements of a structure) but on sets of assignments. Sets of assignments are called teams and the semantics is called team semantics. We design model-checking games for logics with team semantics in a general and systematic way. The construction works for any extension of first-order logic by atomic formulae on teams, as long as certain natural conditions are observed which are satisfied by all team properties considered so far in the literature, including dependence, independence, constancy, inclusion, and exclusion.

View PDFchevron_right

Related topics

  • Mathematics
  • Computer Science
  • Philosophy
  • Pure Mathematics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved