We show how mereotopological notions can be expressed by extending intuitionistic propositional logic with propositional quantification and a strong modal operator. We first prove completeness for the logics wrt Kripke models; then we trace the correspondence between Kripke models and topological spaces that have been enhanced with an explicit notion of expressible region. We show how some qualitative spatial notions can be expressed in topological terms. We use the semantical and topological results in order to show how (...) in some extensions of the logics it is possible to express connectedness, non-emptiness and a set of jointly exhaustive, pairwise disjoint, binary relations that play a significant role in qualitative spatial reasoning. (shrink)

I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He (...) notes that only the cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson’s argument. (shrink)

This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.

In this paper the language of first-order modal logic is enriched with an operator @ ('actually') such that, in any model, the evaluation of a formula @A at a possible world depends on the evaluation of A at the actual world. The models have world-variable domains. All the logics that are discussed extend the classical predicate calculus, with or without identity, and conform to the philosophical principle known as serious actualism. The basic logic relies on the (...) system K, whereas others correspond to various properties that the actual world may have. All the logics are axiomatized. (shrink)

In the paper we introduce a wide range of Anderson-like variants of Gödel's theory and prove for each of them strong completeness theorem wrt. corresponding class of modal structures.These theories — all formulated in the 2nd order modal language with a 2nd order unary predicate of positiveness — differ among themselves with respect of: properties of the necessity operator and of the predicate of positiveness, axioms characterizing identity between 1st sort terms, definitions of identity between 2nd (...) sort terms, the treatment of Godlikeness as a term of the 2nd order, the treatment of necessary existence as a term of the 2nd order if there exists the necessity of its presence, the treatment of Ix (Ix(y) is read: terms x, y are identical), for every 1st sort term x, as a term of the 2nd order if there exists the necessity of its presence.Concerning to semantical commitments, the following are essential: (i) 1st order terms order receive only rigid extensions in the constant objectual 1st order domain; (ii) 2nd order terms receive non-rigid extensions in the constant objectual domain of 2nd order and rigid intensions in the constant conceptual 2nd order domain; (iii) The behavior of the identity between 1st sort terms shifts from possible worlds to possible worlds. (shrink)

We generalize two well-known model-theoretic characterization theorems from propositional modal logic to first-order modal logic. We first study FML-definable frames and give a version of the Goldblatt–Thomason theorem for this logic. The advantage of this result, compared with the original Goldblatt–Thomason theorem, is that it does not need the condition of ultrafilter reflection and uses only closure under bounded morphic images, generated subframes and disjoint unions. We then investigate Lindström type theorems for first-order (...) modal logic. We show that FML has the maximal expressive power among the logics extending FML which satisfy compactness, bisimulation invariance and the Tarski union property. (shrink)

A logic is called higher order if it allows for quantification over higher order objects, such as functions of individuals, relations between individuals, functions of functions, relations between functions, etc. Higher order logic began with Frege, was formalized in Russell [46] and Whitehead and Russell [52] early in the previous century, and received its canonical formulation in Church [14].1 While classical type theory has since long been overshadowed by set theory as a foundation of mathematics, (...) recent decades have shown remarkable comebacks in the fields of mechanized reasoning (see, e.g., Benzm¨. (shrink)

This dissertation develops an inferentialist theory of meaning. It takes as a starting point that the sense of a sentence is determined by the rules governing its use. In particular, there are two features of the use of a sentence that jointly determine its sense, the conditions under which it is coherent to assert that sentence and the conditions under which it is coherent to deny that sentence. From this starting point the dissertation develops a theory of quantification as marking (...) coherent ways a language can be expanded and modality as the means by which we can reflect on the norms governing the assertion and denial conditions of our language. If the view of quantification that is argued for is correct, then there is no tension between second-order quantification and nominalism. In particular, the ontological commitments one can incur through the use of a quantifier depend wholly on the ontological commitments one can incur through the use of atomic sentences. The dissertation concludes by applying the developed theory of meaning to the metaphysical issue of necessitism and contingentism. Two objections to a logic of contingentism are raised and addressed. The resulting logic is shown to meet all the requirement that the dissertation lays out for a theory of meaning for quantifiers and modal operators. (shrink)

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E. In contrast to the well-known interpretation of higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE, but rather by a suitable complete Heyting algebra H. The canonical map relating H and ΩE both serves to interpret equality and provides a modal operator on H in the form of a comonad. Examples of such (...) structures arise from surjective geometric morphisms f : F → E, where H = f∗ΩF. The logic differs from non-modal higher-order logic in that the principles of functional and propositional extensionality are not longer valid but may be replaced by modalized versions. The usual Kripke, neighborhood, and sheaf semantics for propositional and first-order modal logic are subsumed by this notion. (shrink)

First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal (...) logic: its formal semantics, and a proof procedure using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in G¨ odel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation. (shrink)

INTENSIONAL LOGIC §1. Natural Language and Intensional Logic When we speak of a theory of meaning for a natural language such as English, we have in mind an ...

CHAPTER 1. INTENSIONAL LOGIC §1. Natural Language and Intensional Logic When we speak of a theory of meaning for a natural language such as English, ...

The dissertation introduces new sequent-calculi for free first- and second-order logic, and a hyper-sequent calculus for modal logics K, D, T, B, S4, and S5; to attain the calculi for the stronger modal logics, only external structural rules need to be added to the calculus for K, while operational and internal structural rules remain the same. Completeness and cut-elimination are proved for all calculi presented.Philosophically, the dissertation develops an inferentialist, or proof-theoretic, theory of meaning. It takes (...) as a starting point that the sense of a sentence is determined by the rules governing its use. In particular, there are two features of the use of a sentence that jointly determine its sense, the conditions under which it is coherent to assert that sentence and the conditions under which it is coherent to deny that sentence. The dissertation develops a theory of quantification as marking coherent ways a language can be expanded and modality as the means by which we can reflect on the norms governing the assertion and denial conditions of our language. If the view of quantification that is argued for is correct, then there is no tension between second-order quantification and nominalism. In particular, the ontological commitments one can incur through the use of a quantifier depend wholly on the ontological commitments one can incur through the use of atomic sentences. The dissertation concludes by applying the developed theory of meaning to the metaphysical issue of necessitism and contingentism. Two objections to a logic of contingentism are raised and addressed. The resulting logic is shown to meet all the requirement that the dissertation lays out for a theory of meaning for quantifiers and modal operators.Abstract prepared by Andrew ParisiE-mail: [email protected]: https://opencommons.uconn.edu/dissertations/1480/. (shrink)

Closure spaces are generalizations of topological spaces, in which the Intersection of two open sets need not be open. The considered logic is related to closure spaces just as the standard logic S4 to topological ones. After describing basic properties of the logic we consider problems of representation of Lindenbaum algebras with some uncountable sets of infinite joins and meets, a notion of equality and a meaning of quantifiers. Results are extended onto the standard logic S4 (...) and they are valid also for some other standard modal logics. (shrink)

The most common first- and second-order modal logics either have as theorems every instance of the Barcan and Converse Barcan formulae and of their second-order analogues, or else fail to capture the actual truth of every theorem of classical first- and second-order logic. In this paper we characterise and motivate sound and complete first- and second-order modal logics that successfully capture the actual truth of every theorem of classical first- and second-order (...) class='Hi'>logic and yet do not possess controversial instances of the Barcan and Converse Barcan formulae as theorems, nor of their second-order analogues. What makes possible these results is an understanding of the individual constants and predicates of the target languages as strongly Millian expressions, where a strongly Millian expression is one that has an actually existing entity as its semantic value. For this reason these logics are called ‘strongly Millian’. It is shown that the strength of the strongly Millian second-order modal logics here characterised afford the means to resist an argument by Timothy Williamson for the truth of the claim that necessarily, every property necessarily exists. (shrink)

Second-order logic and modal logic are both, separately, major topics of philosophical discussion. Although both have been criticized by Quine and others, increasingly many philosophers find their strictures uncompelling, and regard both branches of logic as valuable resources for the articulation and investigation of significant issues in logical metaphysics and elsewhere. One might therefore expect some combination of the two sorts of logic to constitute a natural and more comprehensive background logic for metaphysics. (...) So it is somewhat surprising to find that philosophical discussion of secondorder modal logic is almost totally absent, despite the pioneering contribution of Barcan. (shrink)

The paper considers the set ML 1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML 1 , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.

The first amounts, roughly, to "It is necessarily the case that any President of the U.S. is a citizen of the U.S." But the second says, "the person who in fact is the President of the U.S, has the property of necessarily being a citizen of the U.S," Thus, while (2) is clearly true, it would be reasonable to consider (3) false.

The paper considers the set $\mathscr{M}\mathscr{L}_1$ of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in $\mathscr{M}\mathscr{L}_1$, which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive (...) power of these extensions are often justified only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

In spite of the philosophical significance of higher-order modal logic, the modal logician's main concern has been with sentential logic. In this paper we do not intend to go into philosophical details, but we only remark that higher-order modal logic has a close relationship with Montague's well-known idea of “universal grammar”, which is an ambitious attempt to build a logical theory of natural languages with exact syntax and semantics, comparable with the artificial (...) languages of mathematical logic. For this matter, the reader can consult, e.g., Montague [8], [9] and Gallin [2]. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without (...) the Barcan Formula (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

As McKinsey and Tarski showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for propositional modal logic, in which the “necessity” operation is modeled by taking the interior of an arbitrary subset of a topological space. In this article, the topological interpretation is extended in a natural way to arbitrary theories of full first-order logic. The resulting system of S4 first-order modal logic is complete with (...) respect to such topological semantics. (shrink)

A well established technique toward developing the proof theory of a Hilbert-style modal logic is to introduce a Gentzen-style equivalent (a Gentzenisation), then develop the proof theory of the latter, and finally transfer the metatheoretical results to the original logic (e.g., [1, 6, 8, 18, 10, 12]). In the first-order modal case, on one hand we know that the Gentzenisation of the straightforward first-order extension of GL, the logic QGL, admits no cut elimination (...) (if the rule is included as primitive; or, if not included, then the rule is not admissible [1]). On the other hand the (cut-free) Gentzenisations of the first-order modal logics M3 and ML3 of [10, 12] do have cut as an admissible rule. The syntactic cut admissibility proof given in [18] for the Gentzenisation of the propositional provability logic GL is extremely complex, and it was the basis of the proofs of cut admissibility of the Gentzenisations of M3 and ML3, where the presence of quantifiers and quantifier rules added to the complexity and length of the proof. A recent proof of cut admissibility in a cut-free Gentzenisation of GL is given in [5] and is quite short and easy to read. We adapt it here to revisit the proofs for the cases of M3 and ML3, resulting to similarly short and easy to read proofs, only slightly complicated by the presence of quantification and its relevant rules. (shrink)

We consider first order modal logic C firstly defined by Carnap in “Meaning and Necessity” [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0′. We compare this logic with the logics of Henkin quantifiers, Σ11 logic, and SO. We also shortly discuss properties of the logic C in finite (...) models. (shrink)

Reformulation strategies for solving Fitch’s paradox of knowability date back to Edgington. Their core assumption is that the formula \, from which the paradox originates, does not correctly express the intended meaning of the verification thesis, which should concern possible knowledge of actual truths, and therefore the contradiction does not represent a logical refutation of verificationism. Supporters of these solutions claim that can be reformulated in a way that blocks the derivation of the paradox. Unfortunately, these reformulation proposals come with (...) other problems, on both the logical and the philosophical side. We claim that in order to make the reformulation idea consistent and adequate one should analyze the paradox from the point of view of a quantified modal language. An approach in this line was proposed by, among others, Kvanvig but was not fully developed in its technical details. Here we approach the paradox by means of a first order hybrid modal logic, a tool that strikes us as more adequate to express transworld reference and the rigidification needed to consistently express this idea. The outcome of our analysis is ambivalent. Given a first order formula we are able to express the fact that it is knowable in a way which is both consistent and adequate. However, one must give up the possibility of formulating as a substitution free schema of the kind \. We propose that one may instead formulate by means of a recursive translation of the initial formula, being aware that many alternative translations are possible. (shrink)

One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T and D, (...) adding such machinery produces a decidable logic, but adding it to S5 produces an undecidable one. Further, if an equality symbol is in the language, and interpreted by the equality relation, logics from K4 to S5 yield undecidable versions. (Thus transitivity is the villain here.) The proof of undecidability consists in showing that classical first-order logic can be embedded. (shrink)

This paper responds to criticism of the Kripkean account of logical truth in first-order modal logic. The criticism, largely ignored in the literature, claims that when the box and diamond are interpreted as the logical modality operators, the Kripkean account is extensionally incorrect because it fails to reflect the fact that all sentences stating truths about what is logically possible are themselves logically necessary. I defend the Kripkean account by arguing that some true sentences about logical possibility (...) are not logically necessary. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without (...) the Barcan Formula (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

This paper expands upon the work by Wang (Proceedings of TARK, pp. 493–512, 2017) who proposes a new framework based on quantifier-free predicate language extended by a new bundled modality \(\exists x\Box \) and axiomatizes the logic over S5 frames. This paper first gives complete axiomatizations of the logics over K, D, T, 4, S4 frames with increasing domains and constant domains, respectively. The systems w.r.t. constant domains feature infinitely many additional rules defined inductively than systems w.r.t. increasing domains. (...) In the second part of the paper, we show that these rules are admissible in the systems without them by providing a general strategy for proving completeness theorems for the logics without these rules over constant domain models (also increasing domain models). (shrink)

According to Frege's principle the denotation of a sentence coincides with its truth-value. The principle is investigated within the context of abstract algebraic logic, and it is shown that taken together with the deduction theorem it characterizes intuitionistic logic in a certain strong sense.A 2nd-order matrix is an algebra together with an algebraic closed set system on its universe. A deductive system is a second-order matrix over the formula algebra of some fixed but arbitrary language. A (...) second-order matrix A is Fregean if, for any subset X of A, the set of all pairs a,b such that X{a} and X{b} have the same closure is a congruence relation on A. Hence a deductive system is Fregean if interderivability is compositional. The logics intermediate between the classical and intuitionistic propositional calculi are the paradigms for Fregean logics. Normal modal logics are non-Fregean while quasi-normal modal logics are generally Fregean.The main results of the paper: Fregean deductive systems that either have the deduction theorem, or are protoalgebraic and have conjunction, are completely characterized. They are essentially the intermediate logics, possibly with additional connectives. All the full matrix models of a protoalgebraic Fregean deductive system are Fregean, and, conversely, the deductive system determined by any class of Fregean second-order matrices is Fregean. The latter result is used to construct an example of a protoalgebraic Fregean deductive system that is not strongly algebraizable. (shrink)

We prove that the positive fragment of first-order intuitionistic logic in the language with two individual variables and a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable. This holds true regardless of whether we consider semantics with expanding or constant domains. We then generalise this result to intervals \ and \, where QKC is the logic of the weak law of the excluded middle and QBL and QFL are first-order counterparts of Visser’s (...) basic and formal logics, respectively. We also show that, for most “natural” first-order modal logics, the two-variable fragment with a single monadic predicate letter, without functional symbols, constants, and equality, is undecidable, regardless of whether we consider semantics with expanding or constant domains. These include all sublogics of QKTB, QGL, and QGrz—among them, QK, QT, QKB, QD, QK4, and QS4. (shrink)

Edward Nieznanski developed in 2007 and 2008 two different systems in formal logic which deal with the problem of evil. Particularly, his aim is to refute a version of the logical problem of evil associated with a form of religious determinism. In this paper, we revisit his first system to give a more suitable form to it, reformulating it in first-order modal logic. The new resulting system, called N1, has much of the original basic structure, and (...) many axioms, definitions, and theorems still remain; however, some new results are obtained. If the conclusions attained are correct and true, then N1 solves the problem of evil through the refutation of a version of religious determinism, showing that the attributes of God in Classical Theism, namely, those of omniscience, omnipotence, infallibility, and omnibenevolence, when adequately formalized, are consistent with the existence of evil in the world. We consider that N1 is a good example of how formal systems can be applied in solving interesting philosophical issues, particularly in Philosophy of Religion and Analytic Theology, establishing bridges between such disciplines. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without (...) the Barcan Formula (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

In this text, a variety of modal logics at the sentential, first-order, and second-order levels are developed with clarity, precision and philosophical insight.