8,378 research outputs found
Changing a semantics: opportunism or courage?
The generalized models for higher-order logics introduced by Leon Henkin, and
their multiple offspring over the years, have become a standard tool in many
areas of logic. Even so, discussion has persisted about their technical status,
and perhaps even their conceptual legitimacy. This paper gives a systematic
view of generalized model techniques, discusses what they mean in mathematical
and philosophical terms, and presents a few technical themes and results about
their role in algebraic representation, calibrating provability, lowering
complexity, understanding fixed-point logics, and achieving set-theoretic
absoluteness. We also show how thinking about Henkin's approach to semantics of
logical systems in this generality can yield new results, dispelling the
impression of adhocness. This paper is dedicated to Leon Henkin, a deep
logician who has changed the way we all work, while also being an always open,
modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on
his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and
Alonso, E., 201
Recommended from our members
On the Logic of Belief and Propositional Quantification
We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as “everything I believe is true” or “there is some-thing that I neither believe nor disbelieve.” Our main results are axiomatizations of the logics with propositional quantifiers of natural classes of complete Boolean algebras with an operator (BAOs) validating KD45. Among them is the class of complete, atomic, and completely multiplicative BAOs validating KD45. Hence, by duality, we also cover the usual method of adding propositional quantifiers to normal modal logics by considering their classes of Kripke frames. In addition, we obtain decidability for all the concrete logics we discuss
A Relational Formulation of the Theory of Types
This paper developes a relational---as opposed to a functional---theory of types. The theory is based on Hilbert and Bernays' eta operator plus the identity symbol, from which Church's lambda and the other usual operators are then defined. The logic is intended for use in the semantics of natural language
Actuality and the a priori
We consider a natural-language sentence that cannot be formally represented in a first-order language for epistemic two-dimensional semantics. We also prove this claim in the “Appendix” section. It turns out, however, that the most natural ways to repair the expressive inadequacy of the first-order language render moot the original philosophical motivation of formalizing a priori knowability as necessity along the diagonal
Ontology of sentential moods
In this paper ontological implications of the Barcan formula and its converse will be discussed at the conceptual and technical level. The thesis that will be defended is that sentential moods are not ontologically neutral since the rejection of ontological implications of Barcan formula and its converse is a condition of a possibility of the imperative mood. The paper is divided into four sections. In the first section a systematization of semantical systems of quantified modal logic is introduced for the purpose of making explicit their ontological presuppositions. In this context Jadacki's ontological difference between being and existence is discussed and analyzed within the framework of hereby proposed system of quantified modal logic. The second section discusses ontological implications of the Barcan formula and its converse within the system accommodating the difference between being and existence. The third section presents a proof of incompatibility of the Barcan formula and its converse with the use of imperatives. In the concluding section, a thesis on logical pragmatics foreclosing the dilemma between necessitism and contingentism is put forward and defended against some objections
Higher-Order Contingentism, Part 1: Closure and Generation
This paper is a study of higher-order contingentism – the view, roughly, that it is contingent what properties and propositions there are. We explore the motivations for this view and various ways in which it might be developed, synthesizing and expanding on work by Kit Fine, Robert Stalnaker, and Timothy Williamson. Special attention is paid to the question of whether the view makes sense by its own lights, or whether articulating the view requires drawing distinctions among possibilities that, according to the view itself, do not exist to be drawn. The paper begins with a non-technical exposition of the main ideas and technical results, which can be read on its own. This exposition is followed by a formal investigation of higher-order contingentism, in which the tools of variable-domain intensional model theory are used to articulate various versions of the view, understood as theories formulated in a higher-order modal language. Our overall assessment is mixed: higher-order contingentism can be fleshed out into an elegant systematic theory, but perhaps only at the cost of abandoning some of its original motivations
Two-variable Logic with Counting and a Linear Order
We study the finite satisfiability problem for the two-variable fragment of
first-order logic extended with counting quantifiers (C2) and interpreted over
linearly ordered structures. We show that the problem is undecidable in the
case of two linear orders (in the presence of two other binary symbols). In the
case of one linear order it is NEXPTIME-complete, even in the presence of the
successor relation. Surprisingly, the complexity of the problem explodes when
we add one binary symbol more: C2 with one linear order and in the presence of
other binary predicate symbols is equivalent, under elementary reductions, to
the emptiness problem for multicounter automata
- …