In this article, I develop a novel version of the multiverse theory of sets called hierarchical pluralism by introducing the notion of “degrees of intentionality” of theories. The presented view is articulated for the purpose of reconciling epistemological realism and the multiverse theory of sets so as to preserve a considerable amount of epistemic objectivity when working with the multiverse theory. I give some arguments in favor of a hierarchical picture of the multiverse in which theories or models are thought (...) to be ordered with respect to their plausibility as a manifestation of endorsing the idea that some set theories are more plausible than others. The proposed multiverse account settles the pluralist’s dilemma, the dichotomy that there is a trade-off between the richness of mathematical ontology and the objectivity of mathematical truth. The view also extends and serves as an alternative position to Balaguer’s intention-based Platonism, from which he claims that a certain version of mathematical pluralism follows. (shrink)

This paper belongs to the research on the limit of the first incompleteness theorem. Effectively inseparable (EI) theories can be viewed as an effective version of essentially undecidable (EU) theories, and EI is stronger than EU. We examine this question: Are there minimal effectively inseparable theories with respect to interpretability? We propose tEI, the theory version of EI. We first prove that there are no minimal tEI theories with respect to interpretability (i.e., for any tEI theory T, we can effectively (...) find a theory which is tEI and strictly weaker than T with respect to interpretability). By a theorem due to Pour-EI, we have that tEI is equivalent with EI. Thus, there are no minimal EI theories with respect to interpretability. Also, we prove that there are no minimal finitely axiomatizable EI theories with respect to interpretability. (shrink)

Like many intensional logics, William Parry’s logic of analytic implication PAI admits extensions determined by imposing semantic conditions on its account of modality. PAI is unique, however, in its allowing a second dimension—a topic-theoretic dimension—along which extensions can be defined. The recent introduction by Francesco Berto of topic-sensitive intentional modals (TSIMs)—which disagree with PAI on this type of condition—provide further motivations to examine such topic-theoretic extensions. In this paper, we introduce, motivate, and characterize a number of such extensions of PAI, (...) paying special attention to applications to Berto’s framework and to ways in which the modal and topic-theoretic dimensions influence one another. (shrink)

We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We explore how each of these properties interacts with the lexicographic product, full product, and free superposition of classes of structures. Additionally, we consider the classes of theories which admit configurations indexed by these products. In particular, we show that, under mild assumptions, the products considered in this article do not yield (...) new classes of theories. (shrink)

We consider interpretable topological spaces and topological groups in a p-adically closed field K. We identify a special class of “admissible topologies” with topological tameness properties like generic continuity, similar to the topology on definable subsets of Kn. We show that every interpretable set has at least one admissible topology, and that every interpretable group has a unique admissible group topology. We then consider definable compactness (in the sense of Fornasiero) on interpretable groups. We show that an interpretable group is (...) definably compact if and only if it has finitely satisfiable generics (fsg), generalizing an earlier result on definable groups. As a consequence, we see that fsg is a definable property in definable families of interpretable groups, and that any fsg interpretable group defined over Qp is definably isomorphic to a definable group. (shrink)

We study Martsinkovsky–Russell torsion modules with pure embeddings as an abstract elementary class. We give a model-theoretic characterization of the pure-injective and the Σ-pure-injective modules relative to the class of torsion modules assuming that the torsion submodule is a pure submodule. Our characterization of relative Σ-pure-injective modules extends the classical characterization of Gruson and Jenson as well as Zimmermann. We study the limit models of the class and determine when the class is superstable assuming that the torsion submodule is a (...) pure submodule. As a corollary, we show that the class of torsion abelian groups with pure embeddings is strictly stable (i.e., stable not superstable). (shrink)

In this article, I first analyze and assess the epistemological and semantic status of canonical value-range equations in the formal language of Frege’s Grundgesetze der Arithmetik. I subsequently scrutinize the relation between (a) his informal, metalinguistic stipulation in Grundgesetze I, Section 3, and (b) its formal counterpart, which is Basic Law V. One point I argue for is that the stipulation in Section 3 was designed not only to fix the references of value-range names, but that it was probably also (...) intended to play a regulative role with an eye to Basic Law V. I further intend to shed new light on the status of Frege’s identification of the truth-values with their unit classes in Grundgesetze I, Section 10 and determine its place and importance in his overall logicist project. In a subsequent section, I first discuss the hypothetical extendability of the logical system of Grundgesetze. In what follows, I analyze the incompleteness of that system—were it not inconsistent and hence trivially complete—by focusing on the role of the definite description operator and the axiom governing it (= Basic Law VI) as well as on the role of the application operator. The latter is defined by means of the former. I further comment on the redundancy of an axiom that could be designed to supplement Basic Law VI by incorporating the second clause of Frege’s two-part elucidation of the description operator. I argue that although it seems likely that Basic Law VI could have been shown to be dispensable in Grundgesetze, Frege would probably have been reluctant to dispense with it, despite his commitment to axiomatic parsimony. In my view, the reason is that he considers it essential that every primitive function-name of his formal language be governed and grounded by a basic law that is tailored to the nature and the role of the primitive name occurring at a key point in the law. Toward the end of the article, I propose solutions to two problems with Frege’s use of “=” in the concept-script sentences that result from his definitions involving the replacement of the double stroke of definition with the judgment-stroke. I conclude the article with a summary of the main results that I have achieved. (shrink)

Motivated by the theory of domination for types, we introduce a notion of domination for Keisler measures called extension domination. We argue that this variant of domination behaves similarly to its typesetting counterpart. We prove that extension domination extends domination for types and that it forms a preorder on the space of global Keisler measures. We then explore some basic properties related to this notion (e.g., approximations by formulas, closure under localizations, convex combinations). We also prove a few preservation theorems (...) and provide some explicit examples. (shrink)

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

The purpose of this paper is to generalize Kripke semantics for propositional modal logic by geometrizing it, that is, by considering the space underlying the collection of all possible worlds as an important semantic feature in its own right, so as to take the idea of accessibility seriously. The resulting new modal semantics is worked out in a setting coming from Riemannian geometry, where Kripke semantics is shown to correspond to a particular case, namely, the discrete one. Several correspondence results, (...) established between variants of well-known modal systems and corresponding geometric properties, illustrate the import of this new framework. (shrink)

This paper presents a weak Kleene approach to conditionals that preserves some salient formal features of conditionals, particularly their interdefinability with Boolean logical connectives. I argue that such an approach fares better than other proposed weak logics of conditionals in this regard. In particular, it fares better than the logics proposed by Cooper, Cantwell, Farrell, De Finetti, Égré, Rossi, and Sprenger.

We show that MAκ implies that each collection of Pc-points of size at most κ which has a Pc-point as an RK upper bound also has a Pc-point as an RK lower bound.

This paper begins with a discussion of C. I. Lewis’s theory of meaning in his book, An Analysis of Knowledge and Valuation (1946) and his pragmatic theory of analyticity and necessity. I bring this theories together with some remarks that he makes in an appendix to the second edition of Symbolic Logic to construct an algebraic semantics for his logics S2 and S3. These logics and their semantics are compared and evaluated with regard to how well they implement Lewis’s theories (...) of meaning and analyticity. (shrink)

A set F of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in F. Post clarified when a set of Boolean functions is functionally complete (with respect to classical semantics). In this paper, by extending Post’s theorem, we clarify when a set of Boolean functions is functionally complete with respect to Kripke semantics.

Here we work in an arbitrary o-minimal expansion of a divisible ordered abelian group. We say that a definable ring is definably semiprime if squares of nontrivial two-sided ideals definable in the expansion are nontrivial. We prove a definable version of Wedderburn–Artin theorem and give a characterization of definably semiprime rings.

The main question of this article is whether there is a family closed under finite differences (i.e., if A belongs to the family and B=∗A, then B also belongs to the family) that can be enumerated by any noncomputable c.e. degree, but which cannot be enumerated computably. This question was formulated by Greenberg et al. (2020) in their recent work in which families that are closed under finite differences, close to the Slaman–Wehner families, are deeply studied.

We show that base matrices for P(ω)∕fin of regular height larger than h necessarily have maximal branches that are not cofinal. The same holds for base matrices of height h if tSpoiler

Logic and Philosophy of Logic

Direct download (2 more)  

 

Export citation  

 

Bookmark   1 citation  

The main scope of this short article is to provide a modification of the axioms given by Messmer and Wood for the theory of separably closed fields of positive characteristic and finite imperfectness degree. As their original axioms failed to meet natural expectations, a new axiomatization was given (i.e., Ziegler’s one), but the new axioms do not follow Messmer and Wood’s initial idea. Therefore, we aim to give a correct axiomatization that is more similar to the original one and that, (...) as with the original axioms, involves only one Hasse–Schmidt derivation, this time based on the iterativity conditions corresponding to the Witt group. (shrink)

The spiritus asper as used by Frege in a letter to Russell from 1904 bears resemblance to Church’s lambda. It is natural to ask how they relate to each other. An alternative approach to functional abstraction developed by Per Martin-Löf some thirty years ago allows us to describe the relationship precisely. Frege’s spiritus asper provides a way of restructuring a unary function name in Frege’s sense such that the argument place indicator occurs all the way to the right. Martin-Löf’s alternative (...) approach shows that this is only half of what lambda does. The other half is the deletion of the argument place indicator, resulting in what Frege would have called an isolated function name. (shrink)

We present an algebraic proof of the theorem stating that there are continuum many axiomatic extensions of global consequence associated with modal system E that do not admit the local deduction detachment theorem. We also prove that all these logics lack the finite frame property and have exactly three proper axiomatic extensions, each of which admits the local deduction detachment theorem.

According to Priest, a proof can be distinct from itself in the same way that a number can. Priest does not specify any such number, so the present little note aims at filling this lacuna by providing a plain arithmetical code of a dialetheia similar to but simpler than the one presented in our recent work and thereby a natural number distinct from itself.

We consider structures of the form (Z;+,C), where C is an additive cyclic order on (Z;+). We show that such structures are dp-minimal and in this way produce a continuum-size family of dp-minimal expansions of (Z;+) such that no two members of the family define the same subsets of Z.

For a locally compact group G, we show that it is possible to present the class of continuous unitary representations of G as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how nondegenerate ∗-representations of a general ∗-algebra A (with some mild assumptions) can be viewed as an elementary class, in a many-sorted language, and use the correspondence between continuous unitary representations of G and nondegenerate ∗-representations of L1(G). We relate the notion (...) of ultraproduct of logical structures, under this presentation, with other notions of ultraproduct of representations appearing in the literature, and we characterize property (T) for G in terms of the definability of the sets of fixed points of L1 functions on G. (shrink)

Partial combinatory algebras (pcas) are algebraic structures that serve as generalized models of computation. In this article, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene’s models, of van Oosten’s sequential computation model, and of Scott’s graph model, showing that an embedding between two relativized models exists if and only if there exists a particular reduction between the oracles. We obtain a similar result for the lambda calculus, showing in particular that it cannot be (...) embedded in Kleene’s first model. (shrink)

Can one quantify over absolutely everything? Absolutists answer positively, while relativists answer negatively. Here, I focus on the absolutism versus relativism debate in the framework of theories of truth, where relativism becomes a form of contextualism about truth predications. Contextualist theories of truth provide elegant and uniform solutions to the semantic paradoxes while preserving classical logic. However, they interpret harmless generalizations (such as “everything is self-identical”) in less than absolutely comprehensive domains, thus systematically misconstruing them. In this article, I show (...) that contextualism is broadly compatible with absolute generality. More specifically, I develop a bipartite contextualist semantics, or “bicontextualism,” on which sentences are split in two groups: the unproblematic sentences, which are compatible with absolute generality, and the problematic ones, which are given a relativist semantics. I then argue that bicontextualism retains the advantages of (orthodox) contextualism and does not give rise to new revenge paradoxes. (shrink)

This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic even when classical logic is used for logical closure in the object language.

We provide a sound and complete proof system for an extension of Kleene’s ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of “is defined” is extended to terms and formulas via a straightforward recursive algorithm. The “is defined” formulas are constructed so that they themselves are always defined. The completeness proof relies on the Henkin construction. For each formula, precisely one of the (...) formula, its negation, and the negation of its “is defined” formula is true on the constructed model. Many other ternary logics in the literature can be reduced to ours. Partial functions are ubiquitous in computer science and even in (in)equation solving at schools. Our work was motivated by an attempt to precisely explain, in terms of logic, typical informal methods of reasoning in such applications. (shrink)

This article studies the complexity of decomposability of rings from the perspective of computability. Based on the equivalence between the decomposition of rings and that of the identity of rings, we propose four kinds of rings, namely, weakly decomposable rings, decomposable rings, weakly block decomposable rings, and block decomposable rings. Let R be the index set of computable rings. We study the complexity of subclasses of computable rings, showing that the index set of computable weakly decomposable rings is m-complete Σ10 (...) within R and that the index set of computable decomposable (resp., weakly block decomposable, block decomposable) rings is m-complete Σ20 within R. (shrink)