Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like ‘All the theorems are true’, ‘Everything Peter said is true’, etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first‐order logic, full second‐order logic, and existential second‐order logic. (shrink)

According to the semantic view, a theory is characterized by a class of models. In this paper, we examine critically some of the assumptions that underlie this approach. First, we recall that models are models of something. Thus we cannot leave completely aside the axiomatization of the theories under consideration, nor can we ignore the metamathematics used to elaborate these models, for changes in the metamathematics often impose restrictions on the resulting models. Second, based on a parallel between van Fraassen’s (...) modal interpretation of quantum mechanics and Skolem’s relativism regarding set-theoretic concepts, we introduce a distinction between relative and absolute concepts in the context of the models of a scientific theory. And we discuss the significance of that distinction. Finally, by focusing on contemporary particle physics, we raise the question: since there is no general accepted unification of the parts of the standard model (namely, QED and QCD), we have no theory, in the usual sense of the term. This poses a difficulty: if there is no theory, how can we speak of its models? What are the latter models of? We conclude by noting that it is unclear that the semantic view can be applied to contemporary physical theories. (shrink)

According to the semantic view, a theory is characterized by a class of models. In this paper, we examine critically some of the assumptions that underlie this approach. First, we recall that models are models of something. Thus we cannot leave completely aside the axiomatization of the theories under consideration, nor can we ignore the metamathematics used to elaborate these models, for changes in the metamathematics often impose restrictions on the resulting models. Second, based on a parallel between van Fraassen’s (...) modal interpretation of quantum mechanics and Skolem’s relativism regarding set-theoretic concepts, we introduce a distinction between relative and absolute concepts in the context of the models of a scientific theory. And we discuss the significance of that distinction. Finally, by focusing on contemporary particle physics, we raise the question: since there is no general accepted unification of the parts of the standard model, we have no theory, in the usual sense of the term. This poses a difficulty: if there is no theory, how can we speak of its models? What are the latter models of? We conclude by noting that it is unclear that the semantic view can be applied to contemporary physical theories. (shrink)

We define a first-order theory FIN which has a recursive axiomatization and has the following two properties. Each finite part of FIN has finite models. FIN is strong enough to develop that part of mathematics which is used or has potential applications in natural science. This work can also be regarded as a consistency proof of this hitherto informal part of mathematics. In FIN one can count every set; this permits one to prove some new probabilistic theorems.

are considered with a view toward analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding II' ,over certain transition predicates computable in log space). and (ii) as a tool for analyzing the dependence of transitions on data (which can be shown to be elementary or nonelementary. depending on the formulation of the (...) transitions). (shrink)

An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .

This article presents a reconstruction of the so-called classical, formal or Mendelian genetics, which is intended to be more complete and adequate than existing reconstructions. This reconstruction has been carried out with the instruments, duly modified and extended with respect to the case under consideration, of the structuralist conception of theories. The so-called Mendel’s Laws, as well as linkage genetics and gene mapping are formulated in a precise manner while the global structure of genetics is represented as a theory-net. These (...) results are of methodological, philosophical and didactical relevance. (shrink)

Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.

Dynamic and proof-conditional approaches to discourse (exemplified by Discourse Representation Theory and Type-Theoretical Grammar, respectively) are related through translations and transitions labeled by first-order formulas with anaphoric twists. Type-theoretic contexts are defined relative to a signature and instantiated modeltheoretically, subject to change.

MIPC is a well-known intuitionistic modal logic of Prior and Bull . It is shown that every normal intuitionistic modal logic L over MIPC has the finite model property whenever L is Kripke-complete and universal.

In this paper, a solution to the problem of theoretical terms is developed that is based on Carnap’s doctrine of indirect interpretation of theoretical terms. This doctrine will be given a semantic, model-theoretic explanation that is not given by Carnap himself as he remains content with a syntactic explanation. From that semantic explanation, rules for the truth-value assignment to postulates, i.e. sentences that determine the meaning of theoretical terms, are derived. The logical status of postulates will be clarified thereby in (...) such a way that the problem of theoretical terms disappears. (shrink)

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.

We present a survey of proof theory in the USSR beginning with the paper by Kolmogorov [1925] and ending (mostly) in 1969; the last two sections deal with work done by A. A. Markov and N. A. Shanin in the early seventies, providing a kind of effective interpretation of negative arithmetic formulas. The material is arranged in chronological order and subdivided according to topics of investigation. The exposition is more detailed when the work is little known in the West or (...) the original presentation can be improved using notions or results which appeared later. This includes such topics as Novikov's cut-elimination method (regular formulas) and Maslov's inverse method for the predicate logic. (shrink)

Here, we analyse some recent applications of set theory to topology and argue that set theory is not only the closed domain where mathematics is usually founded, but also a flexible framework where imperfect intuitions can be precisely formalized and technically elaborated before they possibly migrate toward other branches. This apparently new role is mostly reminiscent of the one played by other external fields like theoretical physics, and we think that it could contribute to revitalize the interest in set theory (...) in the future. (shrink)

We may try to explain proofs as chains of valid inference, but the concept of validity needed in such an explanation cannot be the traditional one. For an inference to be legitimate in a proof it must have sufficient epistemic power, so that the proof really justifies its final conclusion. However, the epistemic concepts used to account for this power are in their turn usually explained in terms of the concept of proof. To get out of this circle we may (...) consider an idea within intuitionism about what it is to justify the assertion of a proposition. It depends on Heyting’s view of the meaning of a proposition, but does not presuppose the concept of inference or of proof as chains of inferences. I discuss this idea and what is required in order to use it for an adequate notion of valid inference. (shrink)

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic. (shrink)