Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.
    Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and outer (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
    The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • On Extensions of Elementary Logic.Per Lindström - 1969 - Theoria 35 (1):1-11.
    Download  
     
    Export citation  
     
    Bookmark   111 citations  
  • Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • The logic of forbidden colours.Elena Dragalina Chernaya - 2013 - Epistemology and Philosophy of Science 38 (4):136-149.
    The purpose of this paper is twofold: (1) to clarify Ludwig Wittgenstein’s thesis that colours possess logical structures, focusing on his ‘puzzle proposition’ that “there can be a bluish green but not a reddish green”, (2) to compare modeltheoretical and gametheoretical approaches to the colour exclusion problem. What is gained, then, is a new gametheoretical framework for the logic of ‘forbidden’ (e.g., reddish green and bluish yellow) colours. My larger aim is to discuss phenomenological principles of the demarcation of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
    We consider the expressive power of second - order generalized quantifiers on finite structures, especially with respect to the types of the quantifiers. We show that on finite structures with at most binary relations, there are very powerful second - order generalized quantifiers, even of the simplest possible type. More precisely, if a logic is countable and satisfies some weak closure conditions, then there is a generalized second - order quantifier which is monadic, unary and simple, and a uniformly obtained (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • What is Logical Form?Ernest Lepore & Kirk Ludwig - 2002 - In Gerhard Preyer & Georg Peter (eds.), Logical Form and Language. Oxford, England: Oxford University Press. pp. 54-90.
    Bertrand Russell, in the second of his 1914 Lowell lectures, Our Knowledge of the External World, asserted famously that ‘every philosophical problem, when it is subjected to the necessary analysis and purification, is found either to be not really philosophical at all, or else to be, in the sense in which we are using the word, logical’ (Russell 1993, p. 42). He went on to characterize that portion of logic that concerned the study of forms of propositions, or, as he (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • A history of theoria.Sven Ove Hansson - 2009 - Theoria 75 (1):2-27.
    Theoria , the international Swedish philosophy journal, was founded in 1935. Its contributors in the first 75 years include the major Swedish philosophers from this period and in addition a long list of international philosophers, including A. J. Ayer, C. D. Broad, Ernst Cassirer, Hector Neri Castañeda, Arthur C. Danto, Donald Davidson, Nelson Goodman, R. M. Hare, Carl G. Hempel, Jaakko Hintikka, Saul Kripke, Henry E. Kyburg, Keith Lehrer, Isaac Levi, David Lewis, Gerald MacCallum, Richard Montague, Otto Neurath, Arthur N. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Mental probability logic.Niki Pfeifer & Gernot D. Kleiter - 2009 - Behavioral and Brain Sciences 32 (1):98-99.
    We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • First-Order Quantifiers.G. Aldo Antonelli - manuscript
    In §21 of Grundgesetze der Arithmetik asks us to consider the forms: a a2 = 4 and a a > 0 and notices that they can be obtained from a φ(a) by replacing the function-name placeholder φ(ξ) by names for the functions ξ2 = 4 and ξ > 0 (and the placeholder cannot be replaced by names of objects or of functions of 2 arguments).
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)A characterization of logical constants is possible.Gila Sher - 2003 - Theoria 18 (2):189-198.
    The paper argues that a philosophically informative and mathematically precise characterization is possible by (i) describing a particular proposal for such a characterization, (ii) showing that certain criticisms of this proposal are incorrect, and (iii) discussing the general issue of what a characterization of logical constants aims at achieving.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Sulla relatività logica.Achille C. Varzi - 2004 - In Massimiliano Carrara & Pierdaniele Giaretta (eds.), Filosofia e logica. Rubbettino Editore. pp. 135–173.
    Italian translation of "On Logical Relativity" (2002), by Luca Morena.
    Download  
     
    Export citation  
     
    Bookmark  
  • Aristotelian syllogisms and generalized quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
    The paper elaborates two points: i) There is no principal opposition between predicate logic and adherence to subject-predicate form, ii) Aristotle's treatment of quantifiers fits well into a modern study of generalized quantifiers.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
    Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. Our discussion transcends, however, the (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • The formal-structural view of logical consequence.Gila Sher - 2001 - Philosophical Review 110 (2):241-261.
    In a recent paper, “The Concept of Logical Consequence,” W. H. Hanson criticizes a formal-structural characterization of logical consequence in Tarski and Sher. Hanson accepts many principles of the formal-structural view. Relating to Sher 1991 and 1996a, he says.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Partially-ordered (branching) generalized quantifiers: A general definition.Gila Sher - 1997 - Journal of Philosophical Logic 26 (1):1-43.
    Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Did Tarski commit "Tarski's fallacy"?Gila Sher - 1996 - Journal of Symbolic Logic 61 (2):653-686.
    In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...)
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
    The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type t there is a generalized quantifier of type t which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than t. This was proved for unary similarity types by Per Lindström [17] with (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Relativized logspace and generalized quantifiers over finite ordered structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
    We here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures L C , i.e., logarithmic space relativized to an oracle in C. We show that this is not always (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Complex demonstratives.Josh Dever - 2001 - Linguistics and Philosophy 24 (3):271-330.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • A simple solution to Friedman's fourth problem.Xavier Caicedo - 1986 - Journal of Symbolic Logic 51 (3):778-784.
    It is shown that Friedman's problem, whether there exists a proper extension of first order logic satisfying the compactness and interpolation theorems, has extremely simple positive solutions if one considers extensions by generalized (finitary) propositional connectives. This does not solve, however, the problem of whether such extensions exist which are also closed under relativization of formulas.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Unrestricted quantification and extraordinary context dependence?Michael Glanzberg - 2023 - Philosophical Studies 180 (5):1491-1512.
    This paper revisits a challenge for contextualist approaches to paradoxes such as the Liar paradox and Russell’s paradox. Contextualists argue that these paradoxes are to be resolved by appeal to context dependence. This can offer some nice and effective ways to avoid paradox. But there is a problem. Context dependence is, at least to begin with, a phenomenon in natural language. Is there really such context dependence as the solutions to paradoxes require, and is it really just a familiar linguistic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Logicality and model classes.Juliette Kennedy & Jouko Väänänen - 2021 - Bulletin of Symbolic Logic 27 (4):385-414.
    We ask, when is a property of a model a logical property? According to the so-called Tarski–Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics in which the model class is definable. This results in a graded concept of logicality in the terminology of Sagi [46]. We investigate which characteristics of logics, such as variants of the Löwenheim–Skolem theorem, Completeness theorem, and absoluteness, are relevant from the logicality (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Logical Realism: A Tale of Two Theories.Gila Sher - 2024 - In Sophia Arbeiter & Juliette Kennedy (eds.), The Philosophy of Penelope Maddy. Springer.
    The paper compares two theories of the nature of logic: Penelope Maddy's and my own. The two theories share a significant element: they both view logic as grounded not just in the mind (language, concepts, conventions, etc.), but also, and crucially, in the world. But the two theories differ in significant ways as well. Most distinctly, one is an anti-holist, "austere naturalist" theory while the other is a non-naturalist "foundational-holistic" theory. This methodological difference affects their questions, goals, orientations, the scope (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Human Thought, Mathematics, and Physical Discovery.Gila Sher - 2023 - In Carl Posy & Yemima Ben-Menahem (eds.), Mathematical Knowledge, Objects and Applications: Essays in Memory of Mark Steiner. Springer. pp. 301-325.
    In this paper I discuss Mark Steiner’s view of the contribution of mathematics to physics and take up some of the questions it raises. In particular, I take up the question of discovery and explore two aspects of this question – a metaphysical aspect and a related epistemic aspect. The metaphysical aspect concerns the formal structure of the physical world. Does the physical world have mathematical or formal features or constituents, and what is the nature of these constituents? The related (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Should an Ontological Pluralist Be a Quantificational Pluralist?Byron Simmons - 2022 - Journal of Philosophy 119 (6):324-346.
    Ontological pluralism is the view that there are different fundamental ways of being. Recent defenders of this view—such as Kris McDaniel and Jason Turner—have taken these ways of being to be best captured by semantically primitive quantifier expressions ranging over different domains. They have thus endorsed, what I shall call, quantificational pluralism. I argue that this focus on quantification is a mistake. For, on this view, a quantificational structure—or a quantifier for short—will be whatever part or aspect of reality’s structure (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • ‘Quantifier Variance’ Is Not Quantifier Variance.Poppy Mankowitz - 2021 - Australasian Journal of Philosophy 99 (3):611-627.
    ABSTRACT There has been recent interest in the idea that, when metaphysicians disagree over the truth of (say) ‘There are numbers’ or ‘Chairs exist’, their dispute is merely verbal. This idea has been taken to motivate quantifier variance, the view that the meanings of quantifier expressions vary across different ontological languages, and that each of these meanings is of equal metaphysical merit. I argue that quantifier variance cannot be upheld in light of natural language theorists’ analyses of quantifier expressions. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Invariance as a basis for necessity and laws.Gila Sher - 2021 - Philosophical Studies 178 (12):3945-3974.
    Many philosophers are baffled by necessity. Humeans, in particular, are deeply disturbed by the idea of necessary laws of nature. In this paper I offer a systematic yet down to earth explanation of necessity and laws in terms of invariance. The type of invariance I employ for this purpose generalizes an invariance used in meta-logic. The main idea is that properties and relations in general have certain degrees of invariance, and some properties/relations have a stronger degree of invariance than others. (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Games and Cardinalities in Inquisitive First-Order Logic.Gianluca Grilletti & Ivano Ciardelli - 2023 - Review of Symbolic Logic 16 (1):241-267.
    Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. This paper makes two contributions to the study of this logic. First, we describe an Ehrenfeucht–Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. Second, we use the game to study cardinality quantifiers in the inquisitive setting. That is, we study what (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Shadows of Syntax: Revitalizing Logical and Mathematical Conventionalism.Jared Warren - 2020 - New York, USA: Oxford University Press.
    What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • (1 other version)Invariance and Logicality in Perspective.Gila Sher - 2021 - In Gil Sagi & Jack Woods (eds.), The Semantic Conception of Logic : Essays on Consequence, Invariance, and Meaning. New York, NY: Cambridge University Press. pp. 13-34.
    Although the invariance criterion of logicality first emerged as a criterion of a purely mathematical interest, it has developed into a criterion of considerable linguistic and philosophical interest. In this paper I compare two different perspectives on this criterion. The first is the perspective of natural language. Here, the invariance criterion is measured by its success in capturing our linguistic intuitions about logicality and explaining our logical behavior in natural-linguistic settings. The second perspective is more theoretical. Here, the invariance criterion (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Invariance and Necessity.Gila Sher - 2018 - In Gabriele Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium. Berlin, Boston: De Gruyter. pp. 55-70.
    Properties and relations in general have a certain degree of invariance, and some types of properties/relations have a stronger degree of invariance than others. In this paper I will show how the degrees of invariance of different types of properties are associated with, and explain, the modal force of the laws governing them. This explains differences in the modal force of laws/principles of different disciplines, starting with logic and mathematics and proceeding to physics and biology.
    Download  
     
    Export citation  
     
    Bookmark  
  • Learnability and Semantic Universals.Shane Steinert-Threlkeld & Jakub Szymanik - forthcoming - Semantics and Pragmatics.
    One of the great successes of the application of generalized quantifiers to natural language has been the ability to formulate robust semantic universals. When such a universal is attested, the question arises as to the source of the universal. In this paper, we explore the hypothesis that many semantic universals arise because expressions satisfying the universal are easier to learn than those that do not. While the idea that learnability explains universals is not new, explicit accounts of learning that can (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)Categories of First -Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - Lvov-Warsaw School. Past and Present.
    One well known problem regarding quantifiers, in particular the 1st order quantifiers, is connected with their syntactic categories and denotations.The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Categories of First-Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Cham, Switzerland: Springer- Birkhauser,. pp. 575-597.
    One well known problem regarding quantifiers, in particular the 1storder quantifiers, is connected with their syntactic categories and denotations. The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the explanatory power of truth in logic.Gila Sher - 2018 - Philosophical Issues 28 (1):348-373.
    Philosophers are divided on whether the proof- or truth-theoretic approach to logic is more fruitful. The paper demonstrates the considerable explanatory power of a truth-based approach to logic by showing that and how it can provide (i) an explanatory characterization —both semantic and proof-theoretical—of logical inference, (ii) an explanatory criterion for logical constants and operators, (iii) an explanatory account of logic’s role (function) in knowledge, as well as explanations of (iv) the characteristic features of logic —formality, strong modal force, generality, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generalized Löb’s Theorem.Strong Reflection Principles and Large Cardinal Axioms. Consistency Results in Topology.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal (Vol. 4, No. 1-1):1-5.
    Download  
     
    Export citation  
     
    Bookmark  
  • Generalized Löb’s Theorem. Strong Reflection Principles and Large Cardinal Axioms.Jaykov Foukzon - 2013 - Advances in Pure Mathematics (3):368-373.
    In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Invariance and Definability, with and without Equality.Denis Bonnay & Fredrik Engström - 2018 - Notre Dame Journal of Formal Logic 59 (1):109-133.
    The dual character of invariance under transformations and definability by some operations has been used in classical works by, for example, Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves could be characterized in terms of invariance. In this article, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in L∞∞ so as to cover the cases that are of interest in the logicality debates, getting McGee’s theorem about quantifiers (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The many faces of interpolation.Johan Benthem - 2008 - Synthese 164 (3):451-460.
    We present a number of, somewhat unusual, ways of describing what Craig’s interpolation theorem achieves, and use them to identify some open problems and further directions.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)A Characterization of Logical Constants Is Possible.Gila Sher - 2010 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 18 (2):189-198.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Generalized Quantifiers: Logic and Language.Duilio D'Alfonso - 2011 - Logic and Philosophy of Science 9 (No. 1):85-94.
    The Generalized Quantifiers Theory, I will argue, in the second half of last Century has led to an important rapprochement, relevant both in logic and in linguistics, between logical quantification theories and the semantic analysis of quantification in natural languages. In this paper I concisely illustrate the formal aspects and the theoretical implications of this rapprochement.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Life on the Range.G. Aldo Antonelli - 2015 - In Alessandro Torza (ed.), Quantifiers, Quantifiers, and Quantifiers. Themes in Logic, Metaphysics, and Language. (Synthese Library vol. 373). Springer. pp. 171-189.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Relevant first-order logic LP# and Curry’s paradox resolution.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal Volume 4, Issue 1-1, January 2015 DOI: 10.11648/J.Pamj.S.2015040101.12.
    In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s paraconsistent Set Theories〖NF〗n^C.
    Download  
     
    Export citation  
     
    Bookmark  
  • On Logical Relativity.Achille C. Varzi - 2002 - Philosophical Issues 12 (1):197-219.
    One logic or many? I say—many. Or rather, I say there is one logic for each way of specifying the class of all possible circumstances, or models, i.e., all ways of interpreting a given language. But because there is no unique way of doing this, I say there is no unique logic except in a relative sense. Indeed, given any two competing logical theories T1 and T2 (in the same language) one could always consider their common core, T, and settle (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Dependence Logic with a Majority Quantifier.Arnaud Durand, Johannes Ebbing, Juha Kontinen & Heribert Vollmer - 2015 - Journal of Logic, Language and Information 24 (3):289-305.
    We study the extension of dependence logic \ by a majority quantifier \ 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 arities. Our results imply that, from the point of view of descriptive complexity theory, \\) captures the complexity class counting hierarchy. We also obtain characterizations of the individual levels of the counting hierarchy by fragments of \\).
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Necessarily Maybe. Quantifiers, Modality and Vagueness.Alessandro Torza - 2015 - In Quantifiers, Quantifiers, and Quantifiers. Themes in Logic, Metaphysics, and Language. (Synthese Library vol. 373). Springer. pp. 367-387.
    Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Bounds of Logic: A Generalized Viewpoint.Gila Sher - 1991 - MIT Press.
    The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...)
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • The Square of Opposition and Generalized Quantifiers.Duilio D'Alfonso - 2012 - In Jean-Yves Béziau & Dale Jacquette (eds.), Around and Beyond the Square of Opposition. New York: Springer Verlag. pp. 219--227.
    In this paper I propose a set-theoretical interpretation of the logical square of opposition, in the perspective opened by generalized quantifier theory. Generalized quantifiers allow us to account for the semantics of quantificational Noun Phrases, and of other natural language expressions, in a coherent and uniform way. I suggest that in the analysis of the meaning of Noun Phrases and Determiners the square of opposition may help representing some semantic features responsible to different logical properties of these expressions. I will (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations