Results for ' quantifiers'

952 found
Order:
  1. M. Abad Varieties of Three-valued.A. M. Suardiaz A. Quantifier - forthcoming - Studia Logica.
  2. Barry Richards.Temporal Quantifiers Tenses & Semantic Innocence - 1987 - In Ernest LePore, New directions in semantics. Orlando: Academic Press. pp. 337.
     
    Export citation  
     
    Bookmark  
  3. Dag Westerstahl.Branching Generalized Quantifiers - 1987 - In Peter Gärdenfors, Generalized Quantifiers. Reidel Publishing Company. pp. 269.
    No categories
     
    Export citation  
     
    Bookmark  
  4. Jon Barwise.Noun Phrases & Generalized Quantifiers - 1987 - In Peter Gärdenfors, Generalized Quantifiers. Reidel Publishing Company. pp. 31--1.
     
    Export citation  
     
    Bookmark  
  5.  31
    Correspondence and Completeness for Generalized Quantifiers.Natasha Alechina & Michiel van Lambalgen - 1995 - Logic Journal of the IGPL 3 (2-3):167-190.
  6. (1 other version)Logical necessity, physical necessity, ethics, and quantifiers.Richard Montague - 1960 - Inquiry: An Interdisciplinary Journal of Philosophy 3 (1-4):259 – 269.
    Some philosophers, for example Quine, doubt the possibility of jointly using modalities and quantification. Simple model-theoretic considerations, however, lead to a reconciliation of quantifiers with such modal concepts as logical, physical, and ethical necessity, and suggest a general class of modalities of which these are instances. A simple axiom system, analogous to the Lewis systems S1 —S5, is considered in connection with this class of modalities. The system proves to be complete, and its class of theorems decidable.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   51 citations  
  7. Chapter 3: The Semantics of Special Quantifiers in Predicate Position.Friederike Moltmann - 2012 - In Abstract Objects and the Semantics of Natural Language. Oxford, United Kingdom: Oxford University Press.
    This chapter argues that special quantifiers such as 'something' when occurring in argument position are not ordinary or substitutional quantifiers; rather they have a reifying force introducing a domain of tropes or kinds of tropes to quantify over.
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  8.  88
    On modal logic with propositional quantifiers.R. A. Bull - 1969 - Journal of Symbolic Logic 34 (2):257-263.
    I am interested in extending modal calculi by adding propositional quantifiers, given by the rules for quantifier introduction: provided that p does not occur free in A.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  9.  20
    Learning complex action models with quantifiers and logical implications.Hankz Hankui Zhuo, Qiang Yang, Derek Hao Hu & Lei Li - 2010 - Artificial Intelligence 174 (18):1540-1569.
  10. First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
  11.  84
    (1 other version)Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
  12.  80
    What do children know about the universal quantifiers all and each?Patricia J. Brooks & Martin D. S. Braine - 1996 - Cognition 60 (3):235-268.
    Children's comprehension of the universal quantifiers all and each was explored in a series of experiments using a picture selection task. The first experiment examined children's ability to restrict a quantifier to the noun phrase it modifies. The second and third experiments examined children's ability to associate collective, distributive, and exhaustive representations with sentences containing universal quantifiers. The collective representation corresponds to the "group" meaning (for All the flowers are in a vase all of the flowers are in (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  13. (1 other version)Mass and count quantifiers.Jim Higginbotham - 1994 - Linguistics and Philosophy 17 (5):447 - 480.
  14.  59
    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  
  15.  27
    Canonical signed calculi with multi-ary quantifiers.Anna Zamansky & Arnon Avron - 2012 - Annals of Pure and Applied Logic 163 (7):951-960.
  16. Descriptions: Predicates or quantifiers?Berit Brogaard - 2007 - Australasian Journal of Philosophy 85 (1):117 – 136.
    In this paper I revisit the main arguments for a predicate analysis of descriptions in order to determine whether they do in fact undermine Russell's theory. I argue that while the arguments without doubt provide powerful evidence against Russell's original theory, it is far from clear that they tell against a quantificational account of descriptions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  17. If and when if -clauses can restrict quantifiers.Kai von Fintel - manuscript
    The interpretation of if -clauses in the scope of ordinary quantifiers has provoked semanticists into extraordinary measures, such as abandoning compositionality or claiming that if has no meaning. We argue that if -clauses have a normal conditional meaning, even in the scope of ordinary quantifiers, and that the trick is to have the right semantics for conditionals.
     
    Export citation  
     
    Bookmark   28 citations  
  18. Developing Metalogic to Formalize Ontological Disputes of the Systems in Metaphysics by Introducing the Notion of Functionally Isomorphic Quantifiers.Jolly Thomas - 2018 - Logica Universalis 12 (3-4):461-492.
    A general meta-logical theory is developed by considering ontological disputes in the systems of metaphysics. The usefulness of this general meta-logical theory is demonstrated by considering the case of the ontological dispute between the metaphysical systems of Lewis’ Modal Realism and Terence Parsons’ Meinongianism. Using Quine’s criterion of ontological commitments and his views on ontological disagreement, three principles of metalogic is formulated. Based on the three principles of metalogic, the notions of independent variable and dependent variable are introduced. Then, the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19. Ramsey sentences and the meaning of quantifiers.Jaakko Hintikka - 1998 - Philosophy of Science 65 (2):289-305.
    1. Ramsey Sentences and the Function of Theoretical Concepts. In his famous paper “Theories,” Frank Ramsey introduced a technique of examining a scientific theory by means of certain propositions, dubbed later “Ramsey Sentences.” They are the results of what is often called Ramsey elimination. This prima facie elimination is often presented as a method of dispensing with theoretical concepts in scientific theorizing. The idea is this: Assume that we are given a finitely axiomatized scientific theorywhere O1, O2, … are the (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  20.  43
    Barwise: Abstract Model Theory and Generalized Quantifiers.Jouko Va An Anen - 2004 - Bulletin of Symbolic Logic 10 (1):37-53.
    §1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. Examples of such properties areκ-compactness.Any (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  97
    Constructive generalized quantifiers.Göran Sundholm - 1989 - Synthese 79 (1):1 - 12.
  22.  31
    A Preliminary Study of MV-Algebras with Two Quantifiers Which Commute.Aldo Figallo Orellano - 2016 - Studia Logica 104 (5):931-956.
    In this paper we investigate the class of MV-algebras equipped with two quantifiers which commute as a natural generalization of diagonal-free two-dimensional cylindric algebras. In the 40s, Tarski first introduced cylindric algebras in order to provide an algebraic apparatus for the study of classical predicate calculus. The diagonal–free two-dimensional cylindric algebras are special cylindric algebras. The treatment here of MV-algebras is done in terms of implication and negation. This allows us to simplify some results due to Di Nola and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. Barwise: Abstract model theory and generalized quantifiers.Jouko Väänänen - 2004 - Bulletin of Symbolic Logic 10 (1):37-53.
    §1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. Examples of such properties areκ-compactness.Any (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24. Natural language, sortal reducibility and generalized quantifiers.Edward L. Keenan - 1993 - Journal of Symbolic Logic 58 (1):314-325.
    Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and q1x 1⋯ (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  25.  57
    Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
    We study the non-Fregean propositional logic with propositional quantifiers, denoted by $\mathsf{SCI}_{\mathsf{Q}}$. We prove that $\mathsf{SCI}_{\mathsf{Q}}$ does not have the finite model property and that it is undecidable. We also present examples of how to interpret in $\mathsf{SCI}_{\mathsf{Q}}$ various mathematical theories, such as the theory of groups, rings, and fields, and we characterize the spectra of $\mathsf{SCI}_{\mathsf{Q}}$-sentences. Finally, we present a translation of $\mathsf{SCI}_{\mathsf{Q}}$ into a classical two-sorted first-order logic, and we use the translation to prove some model-theoretic properties (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26.  65
    (1 other version)The decision problem for some classes of sentences without quantifiers.J. C. C. McKinsey - 1943 - Journal of Symbolic Logic 8 (2):61-76.
  27.  60
    On the role of Ramsey quantifiers in first order arithmetic.James H. Schmerl & Stephen G. Simpson - 1982 - Journal of Symbolic Logic 47 (2):423-435.
  28.  23
    Elementary-base cirquent calculus II: Choice quantifiers.Giorgi Japaridze - forthcoming - Logic Journal of the IGPL.
    Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article ‘Elementary-base cirquent calculus I: Parallel and choice connectives’ built the sound and complete axiomatization $\textbf{CL16}$ of a propositional fragment of computability logic. The atoms of the language of $\textbf{CL16}$ represent elementary, i.e. moveless, games and the logical vocabulary consists of negation, parallel connectives and choice connectives. The present paper constructs the first-order version $\textbf{CL17}$ of $\textbf{CL16}$, also enjoying soundness and completeness. The language of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  64
    Theory discovery from data with mixed quantifiers.Kevin T. Kelly & Clark Glymour - 1990 - Journal of Philosophical Logic 19 (1):1 - 33.
    Convergent realists desire scientific methods that converge reliably to informative, true theories over a wide range of theoretical possibilities. Much attention has been paid to the problem of induction from quantifier-free data. In this paper, we employ the techniques of formal learning theory and model theory to explore the reliable inference of theories from data containing alternating quantifiers. We obtain a hierarchy of inductive problems depending on the quantifier prefix complexity of the formulas that constitute the data, and we (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30.  37
    Probing the mental representation of quantifiers.Sandro Pezzelle, Raffaella Bernardi & Manuela Piazza - 2018 - Cognition 181 (C):117-126.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  31.  72
    Interpretations of quantifiers.Thomas Baldwin - 1979 - Mind 88 (350):215-240.
  32.  82
    On proper quantifiers I.Ludwik Borkowski - 1958 - Studia Logica 8 (1):65 - 130.
  33.  43
    (1 other version)The problem of Quantificational Completeness and the Characterization of All Perfect Quantifiers in 3-Valued Logics.Walter A. Carnielli - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):19-29.
    This paper investigates a problem related to quantifiers which has some analogies to that of propositional completeness I give a definition of quantifier in many-valued logics generalizing the cases which already occur in first order many- valued logics. Though other definitions are possible, this particular one, which I call distribution quantifiers, generalizes the classical quantifiers in a very natural way, and occurs in finite numbers in every m-valued logic. We then call the problem of quantificationa2 completeness in (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  34.  79
    An intensional parametric semantics for vague quantifiers.Shalom Lappin - 2000 - Linguistics and Philosophy 23 (6):599-620.
  35. Certain Verbs Are Syntactically Explicit Quantifiers.Anna Szabolcsi - 2011 - The Baltic International Yearbook of Cognition, Logic and Communication 6:5.
    Quantification over individuals, times, and worlds can in principle be made explicit in the syntax of the object language, or left to the semantics and spelled out in the meta-language. The traditional view is that quantification over individuals is syntactically explicit, whereas quantification over times and worlds is not. But a growing body of literature proposes a uniform treatment. This paper examines the scopal interaction of aspectual raising verbs (begin), modals (can), and intensional raising verbs (threaten) with quantificational subjects in (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  6
    The Reducibility of Generalized Syllogisms with the Quantifiers in Square {not all} and Square {most}.Zhipeng Yu & Jing Xu - 2024 - Philosophy International Journal 7 (4):1-4.
    To explore the reducibility of non-trivial generalized syllogisms with the quantifiers in Square {not all} and Square {most}, this paper first gives the formalization of generalized syllogisms on the basis of set theory, and then proves the validity of the generalized syllogism EMO-3 by first-order logic and generalized quantifier theory; Finally, with the help of some reductive operations, the other 20 valid generalized syllogisms are deduced from the syllogism EMO-3. In other words, there are the reducible relationships between/among the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  55
    Montague Type Semantics for Modal Logics with Propositional Quantifiers.Dov M. Gabbay - 1971 - Mathematical Logic Quarterly 17 (1):245-249.
  38. The Moral Law and The Good in Temporal Modal Logic with Propositional Quantifiers.Daniel Rönnedal - 2020 - Australasian Journal of Logic 17 (1):22-69.
    The Moral Law is fulfilled iff everything that ought to be the case is the case, and The Good is realised in a possible world w at a time t iff w is deontically accessible from w at t. In this paper, I will introduce a set of temporal modal deontic systems with propositional quantifiers that can be used to prove some interesting theorems about The Moral Law and The Good. First, I will describe a set of systems without (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39. The substitution interpretation of the quantifiers.J. Michael Dunn & Nuel D. Belnap - 1968 - Noûs 2 (2):177-185.
  40.  71
    Substitutional Quantification and Le'sniewskian Quantifiers.Guido Küng & John Thomas Canty - 1970 - Theoria 36 (2):165-182.
  41.  26
    Roman Suszko. A note concerning the binary quantifiers. Theoria , vol. 28 , pp. 269–276.Perry Smith - 1971 - Journal of Symbolic Logic 36 (4):689.
  42.  34
    Preschoolers sometimes know less than we think: The use of quantifiers to solve addition and subtraction tasks.Belinda Blevins-Knabe, Robert G. Cooper, Prentice Starkey, Patty Goth Mace & Ed Leitner - 1987 - Bulletin of the Psychonomic Society 25 (1):31-34.
  43.  70
    Almost Everywhere Elimination of Probability Quantifiers.H. Jerome Keisler & Wafik Boulos Lotfallah - 2009 - Journal of Symbolic Logic 74 (4):1121 - 1142.
    We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like $\exists ^{ \ge 3/4} y$ which says that "for at least 3/4 of all y". These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifier $\exists ^{ \ge r} y$ , where y is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. A Note on the Representation of Branching Quantifiers.F. Guenthner & J. P. Hoepelman - 1976 - Theoretical Linguistics 3:285--289.
  45.  43
    Questions and Quantifiers.Mark A. Brown - 1990 - Theoria 56 (1-2):62-84.
  46.  43
    On bracketing names and quantifiers in first-order logic.Jacek Pasniczek - 1999 - History and Philosophy of Logic 20 (3-4):239-304.
  47. Tense operators versus quantifiers.Terence Parsons - 1973 - Journal of Philosophy 70 (18):609-610.
  48. Logical and linguistic analyses of some central philosophical problems. Perceptual verbs, conceivability, and quantifiers: George Berkeley's master argument and its hidden premise.Robert Calabria Díaz - 2024 - In Carlos Enrique Caorsi & Ricardo J. Navia, Philosophy of language in Uruguay: language, meaning, and philosophy. Lanham: Lexington Books.
     
    Export citation  
     
    Bookmark  
  49. The Quantified Relationship.John Danaher, Sven Nyholm & Brian D. Earp - 2018 - American Journal of Bioethics 18 (2):3-19.
    The growth of self-tracking and personal surveillance has given rise to the Quantified Self movement. Members of this movement seek to enhance their personal well-being, productivity, and self-actualization through the tracking and gamification of personal data. The technologies that make this possible can also track and gamify aspects of our interpersonal, romantic relationships. Several authors have begun to challenge the ethical and normative implications of this development. In this article, we build upon this work to provide a detailed ethical analysis (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  50.  31
    On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem löwenheim theorems and compactness of related quantifiers.Matatyahu Rubin & Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (2):265-283.
    THEOREM 1. (⋄ ℵ 1 ) If B is an infinite Boolean algebra (BA), then there is B 1 such that $|\operatorname{Aut} (B_1)| \leq B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut} (B_1)\rangle \equiv \langle B, \operatorname{Aut}(B)\rangle$ . THEOREM 2. (⋄ ℵ 1 ) There is a countably compact logic stronger than first-order logic even on finite models. This partially answers a question of H. Friedman. These theorems appear in §§ 1 and 2. THEOREM 3. (a) (⋄ ℵ 1 ) If (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 952