Book Chapter10.1007/978-94-015-8879-9_1
Modal quantification over structured domains
Johan van Benthem,Natasha Alechina +1 more
- 01 Jan 1997
- pp 1-27
9
TL;DR: The semantics for quantifiers described in this paper can be viewed both as a new semantics for generalized quantifiers and a new look at standard first-order quantification, bringing the latter closer to modal logic.
read more
Abstract: The semantics for quantifiers described in this paper can be viewed both as a new semantics for generalized quantifiers and as a new look at standard first-order quantification, bringing the latter closer to modal logic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
What Are Hybrid Languages
Patrick Blackburn,Jerry Seligman +1 more
- 01 Jan 1996
TL;DR: It is shown that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first- order expressivity can be gained by adding the universal modality, and that allThree binders can force the existence of infinite models and have undecidable satisfiability problems.
200
On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of
First-Order Logic,Natasha Alechina +1 more
- 01 Jan 1995
TL;DR: In this article, a decidable translation from a language containing a general-ized quantifier Q into a first-order language enriched with a family of predicates is proposed, which is decidable using the method of analytic tableaux.
5
The logic of large enough
Eerke Albert Boiten,Dan Grundy +1 more
- 21 Jun 2010
TL;DR: Calculational properties of this quantifier, also known as "all but finitely many", are investigated, and their application in reasoning about limits of functions is shown.
Phase quantification and frame Theory
Ralf Naumann
- 31 Dec 2021
TL;DR: An outline of how two major strands in Löbner’s work can be combined in a dynamic game theoretical semantics: phase quantification (PQ) and frame theory (FT) is provided.
References
An undecidable problem in correspondence theory
TL;DR: The main result is proved for intuitionistic formulas, but it remains valid for other kinds of propositional formulas by analogous arguments or with the help of various translations.
58
Modal Foundations for Predicate Logic
J.F.A.K. van Benthem
- 01 Jan 1999
TL;DR: In this article, the modal core of predicate logic has been modally deconstructed, and a compositional semantics for rst-order quantiication has been given, which is based on a modal state semantics for predicate logic.
41
Modal Foundations for Predicate Logic
TL;DR: This paper investigatèlighter' versions of this general purpose tool, by modally deconstructing the usual semantics, and locating implicit choice points in its set up, and providing technical elaborations demonstrating its viability.
31