Standard definitions of logical consequence for formal languages are atomistic. They take as their starting point a range of possible assignments of semantic values to the extralogical atomic constituents of the language, each of which generates a unique truth value for each sentence. In modal logic, these possible assignments of semantic values are generated by Kripke-style models involving possible worlds and an accessibility relation. In first-order logic, they involve the standard structures of model theory, as sets of objects from which (...) the extralogical symbols of the language receive their denotations. I argue that there is an alternative, holistic, approach to the task of defining logical consequence for a formal language. It specifies necessary and sufficient conditions for an assignment of truth values to all the sentences of the language to be compatible with the intended interpretation of its logical constants. It achieves this without invoking possible assignments of semantic values to the extralogical atomic constituents of the language, or the formal resources that are employed to generate these. I show how this approach can be successfully applied to modal propositional logic and to first-order logic, modal as well as nonmodal. I show that the holistic definitions of logical consequence that I supply for these languages are equivalent to the standard atomistic definitions. (shrink)

SummaryLeśniewski presented his logical systems in a way which conformed to his nominalism, so the question arises whether Leśniewski's logic can be given a natural formal semantics which, unlike current versions, avoids commitment to abstract entities. Building on hints in Wittgenstein's Tractatus, I develop the idea of a way of meaning which is the basis for what I call combinatorial semantics. I then consider whether this commits us to abstract objects or an intensional metalogic.

There are plausible objections to substitutional construals of generalization. But these objections do not apply to a substitutional construal of generalization proposed by Peter Geach several years ago. This paper examines Geach’s conception.

One way to obtain a comprehensive semantics for various systems of modal logic is to use a general notion of non-normal world. In the present article, a general notion of modal system is considered together with a semantic framework provided by such a general notion of non-normal world. Methodologically, the main purpose of this paper is to provide a logical framework for the study of various modalities, notably prepositional attitudes. Some specific systems are studied together with semantics using non-normal worlds (...) of different kinds. (shrink)

The present article employs a model-theoretic semantics to interpret a fragment of the language of the Quantified Argument Calculus (Quarc), a recently introduced logical system whose main aim is capturing the structure of natural language sentences in a closer way than does the language of classical logic. The main contribution is an axiomatization for the set of formulas that are valid in all standard interpretations within the employed semantics.

The system R## of "true" relevant arithmetic is got by adding the ω-rule "Infer VxAx from AO, A1, A2, ...." to the system R# of "relevant Peano arithmetic". The rule ⊃E (or "gamma") is admissible for R##. This contrasts with the counterexample to ⊃E for R# (Friedman & Meyer, "Whither Relevant Arithmetic"). There is a Way Up part of the proof, which selects an arbitrary non-theorem C of R## and which builds by generalizing Henkin and Belnap arguments a prime theory (...) T which still lacks C. (The key to the Way Up is a Witness Protection Program, using the ω-rule.) But T may be TOO BIG, whence there is a Way Down argument that produces a better theory TR, such that R## ⊆ TR ⊆ T. (The key to the Way Down is a Metavaluation, on which membership in T is combined with ordinary truth-functional conditions to determine TR.) The result is a theory that is Just Right, whence it never happens that A ⊃ C and A are theorems of R## but C is a non-theorem. (shrink)

The logic of partial terms (LPT) is a variety of negative free logic in which functions, as well as predicates, are strict. A companion paper focused on nonconstructive LPTwith definite descriptions, called LPD, and laid the foundation for tableaux systems by defining the concept of an LPDmodel system and establishing Hintikka's Lemma, from which the strong completeness of the corresponding tableaux system readily follows. The present paper utilizes the tableaux system in establishing an Extended Joint Consistency Theorem for LPDthat incorporates (...) the Robinson Joint Consistency Theorem and the Craig-Lyndon Interpolation Lemma. The method of proof is similar to that originally used in establishing the Extended Joint Consistency Theorem for positive free logic. Proof of the Craig-Lyndon Interpolation Lemma for formulas possibly having free variables is readily had in LPTand its intuitionistic counterpart. The paper concludes with a brief discussion of the theory of definitions in LPD. (shrink)

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)

Modal logic has been applied in many different areas, as reasoning about time, knowledge and belief, necessity and possibility, to mention only some examples. In the present paper, an attempt is made to use modal logic to account for the semantics of theoretical sentences in scientific language. Theoretical sentences have been studied extensively since the work of Ramsey and Carnap. The present attempt at a modal analysis is motivated by there being several intended interpretations of the theoretical terms once these (...) terms are introduced through the axioms of a theory. (shrink)

I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been raised against TVS and show (...) that, as applied to several central questions, model-theoretic semantics can be considered TVS in disguise. The conclusion is that the truth-valuational substitutional approach is an adequate tool for many of our logic inquiries, conceptually preferable over model-theoretic semantics. Another conclusion is that formal logic is independent of semantics, apart from its use of the notion of truth, but that even with respect to it its assumptions are minimal. (shrink)

This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.

Frege has proposed to consider names as denoting objects, predicates as standing for concepts and sentences as denoting truth values. He was, however, aware that such denotation does not exhaust all what is to be said about meaning. Therefore he has urged that in addition to such denotation (Bedeutung) an expression has sense (Sinn). The sense is the "way of presentation" of denotation; hence the expressions Morning Star and Evening Star have identical denotations, but different senses. Carnap has proposed to (...) replace Frege's distinction between Sinn and Bedeutung by the distinction between intension and extension. Extension is, according to Carnap, what is shared by every two expressions which can be truthfully declared equivalent; where equivalence means a bit different things for different grammatical categories. In the formalism of the classical logic, the equivalence of two terms T1 and T2 is expressed by the formula T1=T2, that of two sentences ↔ ↔ S1 and S2 is by the formula S1↔ ↔S2, and that of two unary predicates P1 and P2 by the formula.. (shrink)

This paper advances a detailed exploration of the complex relationships among terms, concepts, and synonymy in the UMLS Metathesaurus, and proposes the study and understanding of the Metathesaurus from a model-theoretic perspective. Initial sections provide the background and motivation for such an approach, and a careful informal treatment of these notions is offered as a context and basis for the formal analysis. What emerges from this is a set of puzzles and confusions in the Metathesaurus and its literature pertaining to (...) synonymy and its relation to terms and concepts. A model theory for a segment of the Metathesaurus is then constructed, and its adequacy relative to the informal treatment is demonstrated. Finally, it is shown how this approach clarifies and addresses the puzzles educed from the informal discussion, and how the model-theoretic perspective may be employed to evaluate some fundamental criticisms of the Metathesaurus. (shrink)