Wilfrid Hodges; VIII*—Truth in a Structure, Proceedings of the Aristotelian Society, Volume 86, Issue 1, 1 June 1986, Pages 135–152, https://doi.org/10.1093/ari.

We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the 'information-friendly' language of Hintikka and Sandu. For first-order formulas the semantics reduces to Tarski's semantics for first-order logic. We prove that two formulas have the same (...) interpretation in all structures if and only if replacing an occurrence of one by an occurrence of the other in a sentence never alters the truth-value of the sentence in any structure. (shrink)

§1. The mission of axiomatic set theory. What is set theory needed for in the foundations of mathematics? Why cannot we transact whatever foundational business we have to transact in terms of our ordinary logic without resorting to set theory? There are many possible answers, but most of them are likely to be variations of the same theme. The core area of ordinary logic is by a fairly common consent the received first-order logic. Why cannot it take care of itself? (...) What is it that it cannot do? A large part of every answer is probably that first-order logic cannot handle its own model theory and other metatheory. For instance, a first-order language does not allow the codification of the most important semantical concept, viz. the notion of truth, for that language in that language itself, as shown already in Tarski. In view of such negative results it is generally thought that one of the most important missions of set theory is to provide the wherewithal for a model theory of logic. For instance Gregory H. Moore asserts in his encyclopedia article “Logic and set theory” thatSet theory influenced logic, both through its semantics, by expanding the possible models of various theories and by the formal definition of a model; and through its syntax, by allowing for logical languages in which formulas can be infinite in length or in which the number of symbols is uncountable. (shrink)

I LOGIC IN PHILOSOPHY— PHILOSOPHY OF LOGIC i. On the relation of logic to philosophy I n this book, the consequences of certain logical insights for ...

In order to be able to express all possible patterns of dependence and independence between variables, we have to replace the traditional first-order logic by independence-friendly (IF) logic. Our natural concept of truth for a quantificational sentence S says that all the Skolem functions for S exist. This conception of truth for a sufficiently rich IF first-order language can be expressed in the same language. In a first-order axiomatic set theory, one can apparently express this same concept in set-theoretical terms, (...) since the existence of functions can be expressed there. Because of Tarski's theorem, this is impossible. Hence there must exist set-theoretical statements, even provable ones, which are said to be true in first-order models of axiomatic set theory but whose Skolem functions do not all exist. Hence there are provable sentences in axiomatic set theory that are false in accordance with our ordinary conceptions of set-theoretical truth. Such counter-intuitive propositions have been known to exist, but they have been blamed on the peculiarities of very large sets. It is argued here that this explanation is not correct and that there are intuitively false theorems not involving very large sets. Hence the provability or unprovability of a set-theoretical statement, e.g. of the continuum hypothesis (CH) in axiomatic set theory is not necessarily relevant to the truth of CH. (shrink)

Volume I provides a detailed analysis of cylindric algebras, starting with a formulation of their axioms and a development of their elementary properties, and proceeding to a deeper study of their interrelationships by means of general algebraic notions such as subalgebras, homomorphisms, direct products, free algebras, reducts and relativized algebras.

I want to tell you something about the personal and scientific relationship between Alfred Tarski and Kurt Gödel, more or less chronologically. This is part of a work in progress with Anita Feferman on a biography of Alfred Tarski, and in line with most of the things we do, we’ve talked a great deal about the subject together.

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...) computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics. The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; first-order logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic. (shrink)

One of the greatest revolutions in mathematics occurred when Georg Cantor (1845-1918) promulgated his theory of transfinite sets.

As Wilfrid Hodges has observed, there is no mention of the notion truth-in-a-model in Tarski's article 'The Concept of Truth in Formalized Languages'; nor does truth make many appearances in his papers on model theory from the early 1950s. In later papers from the same decade, however, this reticence is cast aside. Why should Tarski, who defined truth for formalized languages and pretty much founded model theory, have been so reluctant to speak of truth in a model? What might explain (...) the change in his practice? The answers, I believe, lie in Tarski's views on truth simpliciter. (shrink)

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...