Switch to: References

Citations of:

Dependence logic: a new approach to independence friendly logic

New York: Cambridge University Press (2007)

Add citations

You must login to add citations.
  1. Nuel Belnap on Indeterminism and Free Action.Thomas Müller (ed.) - 2014 - Wien, Austria: Springer.
    This volume seeks to further the use of formal methods in clarifying one of the central problems of philosophy: that of our free human agency and its place in our indeterministic world. It celebrates the important contributions made in this area by Nuel Belnap, American logician and philosopher. Philosophically, indeterminism and free action can seem far apart, but in Belnap’s work, they are intimately linked. This book explores their philosophical interconnectedness through a selection of original research papers that build forth (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Advances in Modal Logic, Vol. 13.Nicola Olivetti & Rineke Verbrugge (eds.) - 2020 - College Publications.
  • The Ethics of Nudge.Luc Bovens - 2008 - In Mats J. Hansson & Till Grüne-Yanoff (eds.), Preference Change: Approaches from Philosophy, Economics and Psychology. Springer, Theory and Decision Library A. pp. 207-20.
    In their recently published book Nudge (2008) Richard H. Thaler and Cass R. Sunstein (T&S) defend a position labelled as ‘libertarian paternalism’. Their thinking appeals to both the right and the left of the political spectrum, as evidenced by the bedfellows they keep on either side of the Atlantic. In the US, they have advised Barack Obama, while, in the UK, they were welcomed with open arms by the David Cameron's camp (Chakrabortty 2008). I will consider the following questions. What (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   74 citations  
  • Preference Change: Approaches From Philosophy, Economics and Psychology.Till Grüne-Yanoff & Sven Ove Hansson - 2009 - Dordrecht, Netherland: Springer.
    Changing preferencesis a phenomenonoften invoked but rarely properlyaccounted for. Throughout the history of the social sciences, researchers have come against the possibility that their subjects’ preferenceswere affected by the phenomenato be explainedor by otherfactorsnot taken into accountin the explanation.Sporadically, attempts have been made to systematically investigate these in uences, but none of these seems to have had a lasting impact. Today we are still not much further with respect to preference change than we were at the middle of the last (...)
    No categories
  • Semantic games with chance moves revisited: from IF logic to partial logic.Xuefeng Wen & Shier Ju - 2013 - Synthese 190 (9):1605-1620.
    We associate the semantic game with chance moves conceived by Blinov with Blamey’s partial logic. We give some equivalent alternatives to the semantic game, some of which are with a third player, borrowing the idea of introducing the pseudo-player called Nature in game theory. We observe that IF propositional logic proposed by Sandu and Pietarinen can be equivalently translated to partial logic, which implies that imperfect information may not be necessary for IF propositional logic. We also indicate that some independent (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Erratum to: On Definability in Dependence Logic. [REVIEW]Jouko Väänänen - 2011 - Journal of Logic, Language and Information 20 (1):133-134.
  • IF Modal Logic and Classical Negation.Tero Tulenheimo - 2014 - Studia Logica 102 (1):41-66.
    The present paper provides novel results on the model theory of Independence friendly modal logic. We concentrate on its particularly well-behaved fragment that was introduced in Tulenheimo and Sevenster (Advances in Modal Logic, 2006). Here we refer to this fragment as ‘Simple IF modal logic’ (IFML s ). A model-theoretic criterion is presented which serves to tell when a formula of IFML s is not equivalent to any formula of basic modal logic (ML). We generalize the notion of bisimulation familiar (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Hybrid logic meets if modal logic.Tero Tulenheimo - 2009 - Journal of Logic, Language and Information 18 (4):559-591.
    The hybrid logic and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic is proven to be strictly more expressive than IFML (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
    We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Independendly‐Friendly Logic: Dependence and Independence of Quantifiers in Logic.Gabriel Sandu - 2012 - Philosophy Compass 7 (10):691-711.
    Independence‐Friendly logic introduced by Hintikka and Sandu 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 in classical game theory, but we shall also present its compositional interpretation together with its connections to notions of dependence and dependence between terms.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Dependence logic: A new approach to independence friendly logic – by Jouko Väänänen.Gabriel Sandu - 2009 - Theoria 75 (1):52-64.
  • A Finite Axiomatization of G-Dependence.Gianluca Paolini - 2017 - Journal of Logic, Language and Information 26 (3):293-302.
    We show that a form of dependence known as G-dependence admits a very natural finite axiomatization, as well as Armstrong relations. We also give an explicit translation between functional dependence and G-dependence.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics.Markus Pantsar - 2020 - Minds and Machines 31 (1):75-98.
    In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Logical Tools for Human Thinking: Jaakko Hintikka.Ilkka Niiniluoto - 2016 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 47 (2):267-276.
    One of the many research projects of Jaakko Hintikka was entitled “Logical tools for human thinking and their history”. This is in fact an apt summary of the lifetime work of this master logician who developed several new methods and systems in mathematical and philosophical logic, among them distributive normal forms, model sets, possible-worlds semantics, epistemic logic, doxastic logic, inductive logic, semantic information, game-theoretical semantics, interrogative approach to inquiry, and independence-friendly logic. He applied them to study problems in philosophy of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A Double Team Semantics for Generalized Quantifiers.Antti Kuusisto - 2015 - Journal of Logic, Language and Information 24 (2):149-191.
    We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double team semantics by defining a logic (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • On definability in dependence logic.Juha Kontinen & Jouko Väänänen - 2009 - Journal of Logic, Language and Information 18 (3):317-332.
    We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  • Axiomatizing first-order consequences in dependence logic.Juha Kontinen & Jouko Väänänen - 2013 - Annals of Pure and Applied Logic 164 (11):1101-1117.
    Dependence logic, introduced in Väänänen [11], 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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • 24th Workshop on Logic, Language, Information and Computation.Juliette Kennedy - forthcoming - Logic Journal of the IGPL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Explicating Logical Independence.Lloyd Humberstone - 2020 - Journal of Philosophical Logic 49 (1):135-218.
    Accounts of logical independence which coincide when applied in the case of classical logic diverge elsewhere, raising the question of what a satisfactory all-purpose account of logical independence might look like. ‘All-purpose’ here means: working satisfactorily as applied across different logics, taken as consequence relations. Principal candidate characterizations of independence relative to a consequence relation are that there the consequence relation concerned is determined by only by classes of valuations providing for all possible truth-value combinations for the formulas whose independence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Axiomatizing first-order consequences in independence logic.Miika Hannula - 2015 - Annals of Pure and Applied Logic 166 (1):61-91.
  • First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation.Umberto Grandi & Ulle Endriss - 2013 - Journal of Philosophical Logic 42 (4):595-618.
    In preference aggregation a set of individuals express preferences over a set of alternatives, and these preferences have to be aggregated into a collective preference. When preferences are represented as orders, aggregation procedures are called social welfare functions. Classical results in social choice theory state that it is impossible to aggregate the preferences of a set of individuals under different natural sets of axiomatic conditions. We define a first-order language for social welfare functions and we give a complete axiomatisation for (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Transition semantics: the dynamics of dependence logic.P. Galliani - 2014 - Synthese 191 (6):1249-1276.
    We examine the relationship between dependence logic and game logics. A variant of dynamic game logic, called Transition Logic, is developed, and we show that its relationship with dependence logic is comparable to the one between first-order logic and dynamic game logic discussed by van Benthem. This suggests a new perspective on the interpretation of dependence logic formulas, in terms of assertions about reachability in games of imperfect information against Nature. We then capitalize on this intuition by developing expressively equivalent (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • The Dynamification of Modal Dependence Logic.Pietro Galliani - 2013 - Journal of Logic, Language and Information 22 (3):269-295.
    We examine the transitions between sets of possible worlds described by the compositional semantics of Modal Dependence Logic, and we use them as the basis for a dynamic version of this logic. We give a game theoretic semantics, a (compositional) transition semantics and a power game semantics for this new variant of modal Dependence Logic, and we prove their equivalence; and furthermore, we examine a few of the properties of this formalism and show that Modal Dependence Logic can be recovered (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.
    We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Questions as information types.Ivano Ciardelli - 2018 - Synthese 195 (1):321-365.
    This paper argues that questions have an important role to to play in logic, both semantically and proof-theoretically. Semantically, we show that by generalizing the classical notion of entailment to questions, we can capture not only the standard relation of logical consequence, which holds between pieces of information, but also the relation of logical dependency, which holds between information types. Proof-theoretically, we show that questions may be used in inferences as placeholders for arbitrary information of a given type; by manipulating (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  • The grammar of quantification and the fine structure of interpretation contexts.Adrian Brasoveanu - 2013 - Synthese 190 (15):3001-3051.
    Providing a compositional interpretation procedure for discourses in which descriptions of complex dependencies between interrelated objects are incrementally built is a key challenge for formal theories of natural language interpretation. This paper examines several quantificational phenomena and argues that to account for these phenomena, we need richly structured contexts of interpretation that are passed on between different parts of the same sentence and also across sentential boundaries. The main contribution of the paper is showing how we can add structure to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • How indefinites choose their scope.Adrian Brasoveanu & Donka F. Farkas - 2011 - Linguistics and Philosophy 34 (1):1-55.
    The paper proposes a novel solution to the problem of scope posed by natural language indefinites that captures both the difference in scopal freedom between indefinites and bona fide quantifiers and the syntactic sensitivity that the scope of indefinites does nevertheless exhibit. Following the main insight of choice functional approaches, we connect the special scopal properties of indefinites to the fact that their semantics can be stated in terms of choosing a suitable witness. This is in contrast to bona fide (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Everything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences.Johan Van Benthem, Patrick Girard & Olivier Roy - 2009 - Journal of Philosophical Logic 38 (1):83 - 125.
    This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic analysis and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  • Cooperation in Games and Epistemic Readings of Independence-Friendly Sentences.Fausto Barbero - 2017 - Journal of Logic, Language and Information 26 (3):221-260.
    In the literature on logics of imperfect information it is often stated, incorrectly, that the Game-Theoretical Semantics of Independence-Friendly quantifiers captures the idea that the players of semantical games are forced to make some moves without knowledge of the moves of other players. We survey here the alternative semantics for IF logic that have been suggested in order to enforce this “epistemic reading” of sentences. We introduce some new proposals, and a more general logical language which distinguishes between “independence from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Game theoretical semantics for some non-classical logics.Can Başkent - 2016 - Journal of Applied Non-Classical Logics 26 (3):208-239.
    Paraconsistent logics are the formal systems in which absurdities do not trivialise the logic. In this paper, we give Hintikka-style game theoretical semantics for a variety of paraconsistent and non-classical logics. For this purpose, we consider Priest’s Logic of Paradox, Dunn’s First-Degree Entailment, Routleys’ Relevant Logics, McCall’s Connexive Logic and Belnap’s four-valued logic. We also present a game theoretical characterisation of a translation between Logic of Paradox/Kleene’s K3 and S5. We underline how non-classical logics require different verification games and prove (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.
    We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  • Johan van Benthem on Logic and Information Dynamics.Alexandru Baltag & Sonja Smets (eds.) - 2014 - Cham, Switzerland: Springer International Publishing.
    This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Games: Unifying Logic, Language, and Philosophy.Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.) - 2009 - Dordrecht, Netherland: Springer Verlag.
    This volume presents mathematical game theory as an interface between logic and philosophy.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
  • Logic and games.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
  • The Stories of Logic and Information.Johan van Benthem, Maricarmen Martinez, David Israel & John Perry - unknown
    Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.
     
    Export citation  
     
    Bookmark   17 citations  
  • For Better or for Worse: Dynamic Logics of Preference.Johan van Benthem - unknown
    In the last few years, preference logic and in particular, the dynamic logic of preference change, has suddenly become a live topic in my Amsterdam and Stanford environments. At the request of the editors, this article explains how this interest came about, and what is happening. I mainly present a story around some recent dissertations and supporting papers, which are found in the references. There is no pretense at complete coverage of preference logic (for that, see Hanson 2001) or even (...)
     
    Export citation  
     
    Bookmark   5 citations  
  • Turingin testi, interrogatiivimalli ja tekoäly.Arto Mutanen & Ilpo Halonen - 2020 - Ajatus 77 (1):169-204.
    Turingin testi, interrogatiivimalli ja tekoäly.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • In the Beginning was Game Semantics?Giorgi Japaridze - 2009 - In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Springer Verlag. pp. 249--350.
  • New Remarks on the Concept in Logical Use.Nijaz Ibrulj - 2021 - The Logical Foresight 1 (1):72-85.
    The main thesis of this paper is directed against the traditional (cognitivetheoretical) definition of the concept which claims that the concept is the '' thought about the essence of the object being thought'', i.e. that it is “a set of essential features or essential characteristics of an object''. But the '' set of essential features or essential characteristics of an object of thought'' is a '' content’’ of the thought. The thought about the essence of an object is definition and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Sketch of a Proof-Theoretic Semantics for Necessity.Nils Kürbis - 2020 - In Nicola Olivetti, Rineke Verbrugge & Sara Negri (eds.), Advances in Modal Logic 13. Booklet of Short Papers. Helsinki: pp. 37-43.
    This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rigid and flexible quantification in plural predicate logic.Lucas Champollion, Justin Bledin & Haoze Li - forthcoming - Semantics and Linguistic Theory 27.
    Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • To Know is to Know the Value of Variable.Alexandru Baltag - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 135-155.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations