Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary predicate symbols.Monadic second order logic over infinite words can alternatively be described as a first-order logic interpreted in${\cal P}\left$, the power set Boolean algebra of the natural numbers, equipped with modal operators for ‘initial’, ‘next’, and ‘future’ states. We prove (...) that the first-order theory of this structure is the model companion of a class of algebras corresponding to a version of linear temporal logic without until.The proof makes crucial use of two classical, nontrivial results from the literature, namely the completeness of LTL with respect to the natural numbers, and the correspondence between S1S-formulas and Büchi automata. (shrink)

Sortal concepts are at the center of certain logical discussions and have played a significant role in solutions to particular problems in philosophy. Apart from logic and philosophy, the study of sortal concepts has found its place in specific fields of psychology, such as the theory of infant cognitive development and the theory of human perception. In this monograph, different formal logics for sortal concepts and sortal-related logical notions are characterized. Most of these logics are intensional in nature and (...) possess, in addition, a bidimensional character. That is, they simultaneously represent two different logical dimensions. In most cases, the dimensions are those of time and natural necessity, and, in other cases, those of time and epistemic necessity. Another feature of the logics in question concerns second-order quantification over sortal concepts, a logical notion that is also represented in the logics. Some of the logics adopt a constant domain interpretation, others a varying domain interpretation of such quantification. Two of the above bidimensional logics are philosophically grounded on predication sortalism, that is, on the philosophical view that predication necessarily requires sortal concepts. Another bidimensional logic constitutes a logic for complex sortal predicates. These three sorts of logics are among the important novelties of this work since logics with similar features have not been developed up to now, and they might be instrumental for the solution of philosophically significant problems regarding sortal predicates. The book assumes a modern variant of conceptualism as a philosophical background. For this reason, the approach to sortal predicates is in terms of sortal concepts. Concepts, in general, are here understood as intersubjective realizable cognitive capacities. The proper features of sortal concepts are determined by an analysis of the main features of sortal predicates. Posterior to this analysis, the sortal-related logical notions represented in the above logics are discussed. There is also a discussion on the extent to which the set-theoretic formal semantic systems of the book capture different aspects of the conceptualist approach to sortals. These different semantic frameworks are also related to realist and nominalist approaches to sortal predicates, and possible modifications to them are considered that might represent those alternative approaches. (shrink)

Smullyan in [Smu61] identified the recursion theoretic essence of incompleteness results such as Gödel's first incompleteness theorem and Rosser's theorem. Smullyan showed that, for sufficiently complex theories, the collection of provable formulae and the collection of refutable formulae are effectively inseparable—where formulae and their Gödel numbers are identified. This paper gives a similar treatment for proof speed-up. We say that a formal system S1is speedable over another system S0on a set of formulaeAiff, for each recursive functionh, there is a formulaαinAsuch (...) that the length of the shortest proof ofαin S0is larger thanhof the shortest proof ofαin S1. We characterize speedability in terms of the inseparability by r.e. sets of the collection of formulae which are provable in S1but unprovable in S0from the collectionA–where again formulae and their Gödel numbers are identified. We provide precise definitions of proof length, speedability and r.e. inseparability below.We follow the terminology and notation of [Rog87] with borrowings from [Soa87]. Below,ϕis an acceptable numbering of the partial recursive functions [Rog87] andΦa complexity measure associated withϕ[Blu67], [DW83]. (shrink)

We prove a recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory by using tools from effective descriptive set theory and by revisiting the result of Miller that orbits in Polish G‐spaces are Borel sets.

For f: On → On let supp: = ξ: 0, and let S := {f : On → On : supp finite}. For f,g ϵ S definef ≤ g : ↔ [h one-to-one ⁁ f ≤ g)].A function ψ : S → On is called monotonic increasing, if f≤ψ and if f ≤ g implies ψ ≤ ψ. For a mapping ψ : S → On let Clψ be the least set T of ordinals which contains 0 as an element (...) and which is closed under the following rule: If f ϵ S, range ⊆ T and supp ⊆ T, then ψ ϵ T. Let φ be the enumeration function of the class {ξ: [ξ = ωn]}. Let φ be the induced Schütte-Klammerterm-function which generates the Schütte-Veblen-hierarchy of ordinals. Then φ is monotonic increasing. We show: If ψ: S → On is monotonic increasing, then otyp) ≤ min {ξ : ξ = Φ, where 1ξ = 1 if α = ξ and 1ξ = 0 if α ↔ = 0 if α ≠ ξ. For τ an ordinal let Sτ := {f ϵ S : supp ⊆ τ}. A function ψ : Sτ → On is called τ-monotonic increasing if fξ and if f ≤ g implies ψ ≤ . For a function ψ Sτ → On let Clψ ↔ τ be the least set T of ordinals, which contains 0 as an element, such that if f ϵ Sτ and range ϵ T, then ψ ϵ T. We show: if ≥2 and if ψ Sτ → On is τ-monotonic increasing, then otyp ↔ τ) ≤. We also prove a generalization of this theorem in terms of well-partial orderings. MSC: 03F15, 03E10, 06A06. (shrink)

We reconsider some classical natural semantics of integers in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self-enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations (...) and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations . This contrasts with the well-known fact that usual Kolmogorov complexity does not depend on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

The present article is devoted to a logical treatment of some fundamental concepts involved in responsibility attribution. We specify a theoretical framework based on a language of temporal deontic logic with agent-relative operators for deliberate causal contribution. The framework is endowed with a procedure to solve normative conflicts which arise from the assessment of different normative sources. We provide a characterization result for a basic system within this framework and illustrate how the concepts formalized can be put at (...) work in the analysis of examples of legal reasoning. (shrink)

Let KP- be the theory resulting from Kripke-Platek set theory by restricting Foundation to Set Foundation. Let G: V → V (V:= universe of sets) be a ▵0-definable set function, i.e. there is a ▵0-formula φ(x, y) such that φ(x, G(x)) is true for all sets x, and $V \models \forall x \exists!y\varphi (x, y)$ . In this paper we shall verify (by elementary proof-theoretic methods) that the collection of set functions primitive recursive in G coincides with the collection of (...) those functions which are Σ1-definable in KP- + Σ1-Foundation + ∀ x ∃!yφ (x, y). Moreover, we show that this is still true if one adds Π1-Foundation or a weak version of ▵0-Dependent Choices to the latter theory. (shrink)

This thesis is concerned with extending the underlying logical approach as well as the breadth of applications of the proof mining program to various (mostly previously untreated) areas of nonlinear analysis and optimization, with a particular focus being placed on topics which involve set-valued operators.For this, we extend the current logical methodology of proof mining by new systems and corresponding so-called logical metatheorems that cover these more involved areas of nonlinear analysis. Most of these systems crucially rely on the use (...) of intensional methods, treating sets with potentially high quantifier complexity in the defining matrix via characteristic functions and axioms that describe only their properties and do not completely characterize the elements of the sets.The applicability of all of these metatheorems is then substantiated by a range of case studies for the respective areas which in particular also highlight the naturalness of the use of intensional methods in the design of the corresponding systems.The first new area covered thereby is the theory of nonlinear semigroups induced by corresponding evolution equations for accretive operators. In that context, we present (besides an initial foray into the area from 2015) essentially the first applications of proof mining to the theory of partial differential equations. Concretely, we provide quantitative versions of four central results on the asymptotic behavior of solutions to such equations.The second new area unlocked in this thesis is that of the continuous dual of a Banach space and its norm (which are also approached via intensional methods). This in particular relies on a proof-theoretically tame treatment of suprema over (certain) bounded sets in this intensional context which is further exploited later on. These systems, which give access to this until now untreated fundamental notion from functional analysis, are then used to provide further substantial extensions to treat various notions from convex analysis like the Fréchet derivative of a convex function, Fenchel conjugates, Bregman distances, and monotone operators on Banach spaces in the sense of Browder.These systems are then utilized to provide applications in the context of Picard- and Halpern-style iterations of so-called Bregman strongly nonexpansive mappings where we provide both new quantitative and qualitative results.Lastly, we discuss the key notion of extensionality of a set-valued operator and its relation to set-theoretic maximality principles in more depth (which was already singled out—to some degree—in previous work). We thereby exhibit an issue arising with treating full extensionality in the context of these intensional approaches to set-valued operators and present useful fragments of the full extensionality statement where these issues are avoided.Corresponding to these fragments, we discuss a range of uniform continuity statements for set-valued operators beyond the usual notion involving the Hausdorff-metric. In particular, in that context, we utilize the previous tame treatment of suprema over bounded sets to also provide the first proof-theoretic treatment of that Hausdorff-metric in the context of systems for proof mining.The applicability of this treatment of the Hausdorff-metric is then in particular substantiated by a last case study where we provide quantitative information for a Mann-type iteration of set-valued mappings which are nonexpansive w.r.t. the Hausdorff-metric.The abstract was taken directly from the thesis.Abstract prepared by Nicholas Pischke, Technische Universität Darmstadt, Darmstadt, GermanyE-mail: [email protected]: https://doi.org/10.26083/tuprints-00026584. (shrink)

ABSTRACT Two objects o1, o2 of an information system are said to be complementary with respect to attribute a if α(o1) = -α(o2), where α(o) is the set of values of attribute a assigned to o. They are said to be complementary with respect to a set of attributes A if they are complementary with respect to each attribute α ε A. A multi-modal logical language for reasoning about complementarity relations is presented, with modalities [A] and ?A? parameterised by subsets (...) of a given set ATTR of attributes. Two complete deduction system for the language are presented: a Rasiowa-Sikorski style system using signed formulae, and an equivalent sequent calculus system in Gentzen style complete for theories. (shrink)

The standard interpretation of quantum physics (QP) and some recent generalizations of this theory rest on the adoption of a rerificationist theory of truth and meaning, while most proposals for modifying and interpreting QP in a “realistic” way attribute an ontological status to theoretical physical entities (ontological realism). Both terms of this dichotomy are criticizable, and many quantum paradoxes can be attributed to it. We discuss a new viewpoint in this paper (semantic realism, or briefly SR), which applies both to (...) classical physics (CP) and to QP. and is characterized by the attempt of giving up verificationism without adopting ontological realism. As a first step, we construct a formalized observative language L endowed with a correspondence truth theory. Then, we state a set of axioms by means of L which hold both in CP and in QP. and construct a further language Lv which can express bothtestable andtheoretical properties of a given physical system. The concepts ofmeaning andtestability do not collapse in L and Le hence we can distinguish between semantic and pragmatic compatibility of physical properties and define the concepts of testability and conjoint testability of statements of L and Le. In this context a new metatheoretical principle (MGP) is stated, which limits the validity of empirical physical laws. By applying SR (in particular. MGP) to QP, one can interpret quantum logic as a theory of testability in QP, show that QP is semantically incomplete, and invalidate the widespread claim that contextuality is unavoidable in QP. Furthermore. SR introduces some changes in the conventional interpretation of ideal measurements and Heisenberg’s uncertainty principle. (shrink)

We characterize the proof-theoretic strength of systems of explicit mathematics with a general principle asserting the existence of least fixed points for monotone inductive definitions, in terms of certain systems of analysis and set theory. In the case of analysis, these are systems which contain the Σ12-axiom of choice and Π12-comprehension for formulas without set parameters. In the case of set theory, these are systems containing the Kripke-Platek axioms for a recursively inaccessible universe together with the existence of a stable (...) ordinal. In all cases, the exact strength depends on what forms of induction are admitted in the respective systems. (shrink)

In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a (...) duality of consequence relations, with which we can maintain uniqueness in a bilateralist setting. (shrink)

We give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in [9], where the authors gave such a characterization forκ-saturation, for a cardinal$\kappa \ge \aleph _0 $. Our result extends the characterization of Harnik and Ressayre [7] for a divisible ordered abelian group to be recursively saturated.

This dissertation constitutes an inquiry into the formal aspects of a particular form of conceptual intentional realism: Holistic Realist Ramified Conceptualism. Several axiomatic systems, which have this theory as their philosophical background are developed and/or studied from a syntactical and semantical point of view. ;Among systems studied are Cocchiarella's RRC$\sbsp{\lambda}{\*}$ and HRRC$\sbsp{\lambda}{\*}$. A set theoretical semantics for these systems is developed. Also, completeness theorems with respect to certain extensions of RRC$\sbsp{\lambda}{\*}$ and HRRC$\sbsp{\lambda}{\*}$ and certain notions of validity related to (...) that semantics are proved. A relative consistency proof of RRC$\sbsp{\lambda}{\*}$, HRRC$\sbsp{\lambda}{\*}$ and other systems is given. ;An axiomatic system for identity free realist ramified conceptualism involving indiscernibility relative to constructive concepts is developed. A set theoretical semantics for this system is constructed. A completeness theorem with respect to certain extensions of the identity-free system and a notion of validity related to that semantics is proved. ;Epistemic considerations are brought into this inquiry by introducing an epistemic operator into the logical syntax. Such an operator corresponds intuitively to the idea of constructive knowability. A philosophical discussion of this idea is presented and on the basis of this discussion an epistemic logical theory is formulated. It is shown that this system has HRRC$\sbsp{\lambda}{\*}$ as a proper subsystem. On the basis of the epistemic logical theory, an axiomatic system is introduced from which Peano's arithmetic is deduced. In this way, it is shown that arithmetic can be developed axiomatically on conceptualist foundations. (shrink)

This is a survey of work on set-theoretical invariance criteria for logicality. It begins with a review of the Tarski-Sher thesis in terms, first, of permutation invariance over a given domain and then of isomorphism invariance across domains, both characterized by McGee in terms of definability in the language L∞,∞. It continues with a review of critiques of the Tarski-Sher thesis, and a proposal in response to one of those critiques via homomorphism invariance. That has quite divergent characterization results (...) depending on its formulation, one in terms of FOL, the other by Bonnay in terms of L∞,∞, both without equality. From that we move on to a survey of Bonnay’s work on similarity relations between structures and his results that single out invariance with respect to potential isomorphism among all such. Turning to the critique that calls for sameness of meaning of a logical operation across domains, the paper continues with a result showing that the isomorphism invariant operations that are absolutely definable with respect to KPU−Inf are exactly those definable in full FOL; this makes use of an old theorem of Manders. The concluding section is devoted to a critical discussion of the arguments for set-theoretical criteria for logicality. (shrink)

Probabilistic theories are a natural framework to investigate the foundations of quantum theory and possible alternative or deeper theories. In a generic probabilistic theory, states of a physical system are represented as vectors of outcomes probabilities and state spaces are convex cones. In this picture the physics of a given theory is related to the geometric shape of the cone of states. In quantum theory, for instance, the shape of the cone of states corresponds to a projective space over complex (...) numbers. In this paper we investigate geometric constraints on the state space of a generic theory imposed by the following information theoretic requirements: every non completely mixed state of a system is perfectly distinguishable from some other state in a single shot measurement; information capacity of physical systems is conserved under making mixtures of states. These assumptions guarantee that a generic physical system satisfies a natural principle asserting that the more a state of the system is mixed the less information can be stored in the system using that state as logical value. We show that all theories satisfying the above assumptions are such that the shape of their cones of states is that of a projective space over a generic field of numbers. Remarkably, these theories constitute generalizations of quantum theory where superposition principle holds with coefficients pertaining to a generic field of numbers in place of complex numbers. If the field of numbers is trivial and contains only one element we obtain classical theory. This result tells that superposition principle is quite common among probabilistic theories while its absence gives evidence of either classical theory or an implausible theory. (shrink)

We define a potentialist system of ‐structures, i.e., a collection of possible worlds in the language of connected by a binary accessibility relation, achieving a potentialist account of the full background set‐theoretic universe V. The definition involves Berkeley cardinals, the strongest known large cardinal axioms, inconsistent with the Axiom of Choice. In fact, as background theory we assume just. It turns out that the propositional modal assertions which are valid at every world of our system are exactly those in the (...) modal theory. Moreover, we characterize the worlds satisfying the potentialist maximality principle, and thus the modal theory, both for assertions in the language of and for assertions in the full potentialist language. (shrink)

We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and entrenchment. Contraction is seen as an operation whose goal is to minimize loses of informational value. The operation is also compatible with the principle that in contracting A one should preserve the sentences better entrenched than A (when the belief set contains A). Even when the principle of minimal change and the latter motivation for entrenchment figure prominently among the basic intuitions in (...) the works of, among others, Quine and Ullian (1978), Levi (1980, 1991), Harman (1988) and Gärdenfors (1988), formal accounts of belief change (AGM, KM – see Gärdenfors (1988); Katsuno and Mendelzon (1991)) have abandoned both principles (see Rott (2000)). We argue for the principles and we show how to construct a contraction operation, which obeys both. An axiom system is proposed. We also prove that the decision-theoretic notion of contraction can be completely characterized in terms of the given axioms. Proving this type of completeness result is a well-known open problem in the field, whose solution requires employing both decision-theoretical techniques and logical methods recently used in belief change. (shrink)

Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal (...) modal logics, we show that each basic \ system \ lacks Craig interpolation. Finally, by model theoretical techniques, we show that an extension of \ does have Craig interpolation, as an example of amending the interpolation problem of \. (shrink)

Dynamic Topological Logic ( ) is a modal logic which combines spatial and temporal modalities for reasoning about dynamic topological systems , which are pairs consisting of a topological space X and a continuous function f : X → X . The function f is seen as a change in one unit of time; within one can model the long-term behavior of such systems as f is iterated. One class of dynamic topological systems where the long-term behavior of (...) f is particularly interesting is that of minimal systems ; these are dynamic topological systems which admit no proper, closed, f -invariant subsystems. In such systems the orbit of every point is dense, which within translates into a non-trivial interaction between spatial and temporal modalities. This interaction, however, turns out to make the logic simpler, and while s in general tend to be undecidable, interpreted over minimal systems we obtain decidability, although not in primitive recursive time; this is the main result that we prove in this paper. We also show that interpreted over minimal systems is incomplete for interpretations on relational Kripke frames and hence does not have the finite model property; however it does have a finite non-deterministic quasimodel property. Finally, we give a set of formulas of which characterizes the class of minimal systems within the class of dynamic topological systems, although we do not offer a full axiomatization for the logic. (shrink)

The issue of the emergence of formal axiomatic logical systems due to the emergence of logical antinomies in formal axiomatic systems, specifically the issue of developing formal logical axiomatics in the calculus of considerations was investigated in the considered research. At the same time, in order to determine the characteristics of the implementation of the logical-methodological principles and provisions of the deductive reasoning obviously, conceptual-logical foundations of the calculus of considerations was studied and the main propositions of the calculus of (...) considerations and the analysis of the initial logical operations on them were given in the study. The basic laws of logic and the expression of one logical act with another one were also explained in the research work by giving the concepst of proportional form and tautology in the calculus of considerations. At the same time, main properties and the procedure of setting of the formal deductive theory in the calculus of considerations were studied in the article. In order to provide an adequate characterization of the conceptual and methodological bases of the calculus of considerations in the research work, the basic logical laws of the calculus of considerations developed by the German mathematician and thinker P. Hilbert were also given. In addition, the main principles and methodological provisions of the deductive method were investigated, and the rules of deriving new conclusions from the axioms were interpreted. At the end of the reviewed article, the main principles and methods of the formal axiomatic mathematical systems built on a deductive basis, specifically the calculus of considerations, were studied and a logical-methodological analysis of the calculus of considerations was carried out on this basis. In this framework, the syntactic and semantic analysis of formalized language in formal axiomatic logical systems was carried out separately, the constituent parts of those systems, including the construction scheme, were given. (shrink)

XML documents and, more generally, semistructured data, can be seen as labelled graphs. In this paper we set a correspondence between such graphs and the models of a language of hybrid multimodal logic. This allows us to characterize a schema for semistructured data as a formula of hybrid multimodal logic, and instances of the schema as models of this formula. We also investigate how to express in such a logic integrity constraints on semistructured data, in (...) particular some classes of constraints widely considered in the literature. The contribution of this work is twofold: 1) We generalize the notion of schema, by proposing a definition of schema were references are “well typed”. 2) We formalize semistructured data, schema for semistructured data and integrity constraints in a unique framework, namely hybrid multimodal logic. (shrink)

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic (...) in the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad Absurdum, one obtains a proof system for orthologic; by adding both Reiteration and Reductio, one obtains a proof system for classical logic. Arguably neither Reiteration nor Reductio is as intimately related to the meaning of the connectives as the introduction and elimination rules are, so the base logic we identify serves as a more fundamental starting point and common ground between proponents of intuitionistic logic, orthologic, and classical logic. The algebraic semantics for the logic we motivate proof-theoretically is based on bounded lattices equipped with what has been called a weak pseudocomplementation. We show that such lattice expansions are representable using a set together with a reflexive binary relation satisfying a simple first-order condition, which yields an elegant relational semantics for the logic. This builds on our previous study of representations of lattices with negations, which we extend and specialize for several types of negation in addition to weak pseudocomplementation; in an appendix, we further extend this representation to lattices with implications. Finally, we discuss adding to our logic a conditional obeying only introduction and elimination rules, interpreted as a modality using a family of accessibility relations. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

$${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all the (...) sentences that can jointly be valued as true we introduced the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enabled us to characterize referential contradictions, i.e., sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke-style fixed-point characterization of groundedness was offered, and complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) fixed points were put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of $$\mathcal{F}$$ -systems. We showed the relation between local conglomerates and admissible sets of arguments and argued about the usefulness of the concept for the argumentation theory. (shrink)

The Interrogative Model of Inquiry and Dynamic Epistemic Logics are two central paradigms in formal epistemology. This paper is motivated by the observation of a significant complementarity between them: on the one hand, the IMI provides a framework for investigating inquiry represented as an idealized game between an Inquirer and Nature, along with an account of the interaction between questions and inferences in information-seeking processes, but is lacking a formulation in the multi-agent case; on the other hand, DELs (...) model various operations of information change in multi-agent systems, but the field is lacking a proper integration of question and inference dynamics, along with an application to the investigation of inquiry processes. The goal of this paper is to integrate the two paradigms in such a way as to combine their respective insights. To this end, we develop a formal system called DEL $$_\mathrm{IMI }$$ IMI which aims to represent the interaction between question and inference dynamics in inquiry—as described by the IMI—in a multi-agent setting, and this in such a way as to enable an investigation of inquiry games with multi-agent dimensions. The DEL $$_\mathrm{IMI }$$ IMI system is designed to represent the possible moves of such inquiry games through three types of epistemic actions: agents addressing questions to Nature, agents addressing questions to other agents, agents drawing logical inferences. We then show how the resulting framework can be used to formally define multi-agent inquiry games. We conclude by evaluating the interest of the DEL $$_\mathrm{IMI }$$ IMI system for the IMI and DELs paradigms. (shrink)

A generic computation of a subsetAof ℕ is a computation which correctly computes most of the bits ofA, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory, where it has been noticed that frequently, it is more important to know how difficult a type of problem is in the general case than how difficult it is in the worst case. When we study this concept from a recursion theoretic point of (...) view, to create a transitive relationship, we are forced to consider oracles that sometimes fail to give answers when asked questions. Unfortunately, this makes working in the generic degrees quite difficult. Indeed, we show that generic reduction is$\Pi _1^1$―complete. To help avoid this difficulty, we work with the generic degrees of density-1 reals. We demonstrate how an understanding of these degrees leads to a greater understanding of the overall structure of the generic degrees, and we also use these density-1 sets to provide a new a characterization of the hyperartithmetical Turing degrees. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...) a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.11 This essay offers a more precise exposition of some of the material discussed in the first two chapters of my dissertation (Stovall Citation2015a). These ideas developed in the context of a working group on non-monotonic logic run by Robert Brandom, and they were subsequently clarified through the work of Nissim Francez (particularly Francez Citation2015). I am indebted to many people for feedback and criticism on this essay, though I am sure none among them would agree with everything I say and do here. I would particularly like to thank Brandom, Francez, Ulf Hlobil, Daniel Kaplan, Jared Millson, Bernhard Nickel, Jaroslav Peregrin, Jeffry Pelletier, Thomas Ricketts, Mark Risjord, Shawn Standefer, and two reviewers for this journal. Work on this essay was supported by the joint Lead-Agency research grant between the Austrian Science Foundation (FWF) and the Czech Science Foundation (GAČR), Inferentialism and Collective Intentionality, GF17-33808L. It was substantially revised prior to its final submission. (shrink)

The set of $$\textsf{ST}$$ ST -valid inferences is neither the intersection, nor the union of the sets of $$\textsf{K}_3$$ K 3 -valid and $$\textsf{LP}$$ LP -valid inferences, but despite the proximity to both systems, an extensional characterization of $$\textsf{ST}$$ ST in terms of a natural set-theoretic operation on the sets of $$\textsf{K}_3$$ K 3 -valid and $$\textsf{LP}$$ LP -valid inferences is still wanting. In this paper, we show that it is their relational product. Similarly, we prove that the set (...) of $$\textsf{TS}$$ TS -valid inferences can be identified using a dual notion, namely as the relational sum of the sets of $$\textsf{LP}$$ LP -valid and $$\textsf{K}_3$$ K 3 -valid inferences. We discuss links between these results and the interpolation property of classical logic. We also use those results to revisit the duality between $$\textsf{ST}$$ ST and $$\textsf{TS}$$ TS. We present a notion of duality on which $$\textsf{ST}$$ ST and $$\textsf{TS}$$ TS are dual in exactly the same sense in which $$\textsf{LP}$$ LP and $$\textsf{K}_3$$ K 3 are dual to each other. (shrink)

In this paper we compare grammatical inference in the context of simple and of mixed Lambek systems. Simple Lambek systems are obtained by taking the logic of residuation for a family of multiplicative connectives /, *, \, together with a package of structural postulates characterizing the resource management properties of the * connective. Different choices for Associativity and Commutativity yield the familiar logics NL, L, NLP, LP. Semantically, a simple Lambek system is a unimodal logic: the connectives get (...) a Kripke style interpretation in terms of a single ternary accessibility relation modeling the notion of linguistic composition for each individual system.The simple systems each have their virtues in linguistic analysis. But none of them in isolation provides a basis for a full theory of grammar. In the second part of the paper, we consider two types of mixed Lambek systems.The first type is obtained by combining a number of unimodal systems into one multimodal logic. The combined multimodal logic is set up in such a way that the individual resource management properties of the constituting logics are preserved. But the inferential capacity of the mixed logic is greater than the sum of its component parts through the addition of interaction postulates, together with the corresponding interpretive constraints on frames, regulating the communication between the component logics.The second type of mixed system is obtained by generalizing the residuation scheme for binary connectives to families of n-ary connectives, and by putting together families, of different arities in one logic. We focus on residuation for unary connectives, hence on mixed frames, as these already represent the complexities in full. We prove a number of elementary logical results for unary families of residuated connectives and their combination with binary families. The existing proposals for unary ‘structural modalities’ are situated within this general framework, and a number of new linguistic applications is given. (shrink)

The logic of worldviews provides a consistent method of comparison between multiple worldviews. The present paper connects the logic of worldviews to important historical and contemporary influences. Beginning with its roots in semiotics, an account of epistemology emerges which is mediated by a belief system. We show that Charles Peirce’s pragmatistic theory of inquiry is the bedrock beneath the logic of worldviews. We formulate it as a generalized version of inquiry with underlying game-theoretic semantics. In (...) this paper, we extend Peirce’s triadic model of signs to cover knowledge mediated by systems of beliefs. Michael Polanyi’s account of personal commitment includes a subsidiary/focal distinction that views theoretical frameworks as tools for interpreting orders of reality through actual practices of research. We also see how a precedent is set by Johan Georg Hamann’s epistemology of belief, recovered by Ludwig Wittgenstein, using reason as an interpretation of God’s speech in nature. We argue that Thomas Kuhn’s theory of inquiry and worldviews (or paradigms) may be fruitfully contrasted with Peirce’s theory, with reasoning by abduction, deduction, and induction occurring within the community of inquirers. The upshot is that although worldviews may be adopted for non-rational reasons, one can meaningfully compare worldviews through a method proposed by Alasdair MacIntyre: the proponent of a theory learns the language of competing theories and uses them as a metatheory to show how one’s own theory may not have the resources to resolve certain problematic situations. Our result is a meta-linguistic falsification in the sense of Peirce’s semiotics and pragmaticism: the competing theory may be used to show that the object theory does not have a strategy at its disposal to interpret the anomalous phenomenon. (shrink)

In this review of Mark Weinstein’s Logic, Truth, and Inquiry, a book in which Weinstein explains his conception of the Method of Emerging Truth (MET), the reviewer, Paul Wagner, appreciates Weinstein’s assertion that “The MET attempts to characterize the process of truth emerging as evidence of the epistemic adequacy of the warrants that support theoretical explanations and govern theory driven inferences.” While he finds several things to question in Weinstein’s explanation of this conception, the reviewer, nonetheless, concludes that (...) “This is a book I heartily recommend to every reader especially those interested in critical thinking but whose academic preparation and home is outside philosophy or logic.”. (shrink)

In this paper, we provide a set-theoretic proof of the general representation theorem for MV-algebras, which was developed by Dubuc and Poveda in 2010. The theorem states that every MV-algebra is isomorphic to the MV-algebra of all global sections of its prime spectrum. We avoid using topos theory and instead rely on basic concepts from MV-algebras, topology and set theory.

Foundations of Relational Realism presents an intuitive interpretation of quantum mechanics, based on a revised decoherent histories interpretation, structured within a category theoretic topological formalism. -/- If there is a central conceptual framework that has reliably borne the weight of modern physics as it ascends into the twenty-first century, it is the framework of quantum mechanics. Because of its enduring stability in experimental application, physics has today reached heights that not only inspire wonder, but arguably exceed the limits of intuitive (...) vision, if not intuitive comprehension. For many physicists and philosophers, however, the currently fashionable tendency toward exotic interpretation of the theoretical formalism is recognized not as a mark of ascent for the tower of physics, but rather an indicator of sway—one that must be dampened rather than encouraged if practical progress is to continue. -/- In this unique two-part volume, designed to be comprehensible to both specialists and non-specialists, the authors chart out a pathway forward by identifying the central deficiency in most interpretations of quantum mechanics: That in its conventional, metrical depiction of extension, inherited from the Enlightenment, objects are characterized as fundamental to relations—i.e., such that relations presuppose objects but objects do not presuppose relations. The authors, by contrast, argue that quantum mechanics exemplifies the fact that physical extensiveness is fundamentally topological rather than metrical, with its proper logico-mathematical framework being category theoretic rather than set theoretic. -/- By this thesis, extensiveness fundamentally entails not only relations of objects, but also relations of relations. Thus, the fundamental quanta of quantum physics are properly defined as units of logico-physical relation rather than merely units of physical relata as is the current convention. Objects are always understood as relata, and likewise relations are always understood objectively. In this way, objects and relations are coherently defined as mutually implicative. The conventional notion of a history as “a story about fundamental objects” is thereby reversed, such that the classical “objects” become the story by which we understand physical systems that are fundamentally histories of quantum events. -/- These are just a few of the novel critical claims explored in this volume—claims whose exemplification in quantum mechanics will, the authors argue, serve more broadly as foundational principles for the philosophy of nature as it evolves through the twenty-first century and beyond. (shrink)

SummaryTruth‐definitions play a crucial role in the foundations of logic and semantics. Tarsik‐type truth‐definitions are not possible to formulate in a usual first‐order language for itself, and they have been criticized because they do not account for what makes them definitions of truth. It has been suggested that truth should instead be characterized by reference to the «language‐games» of verification and falsification. The author's game‐theoretical semantics here explained for formal first‐order languages, can be thought of as a realization of (...) this idea. More technically speaking, GTS can also be thought of as a systematization of the well‐known aepsilon‐delta, definitions in the foundations of analysis. In GTS, truth is not defined by reference to winning a play of a game, but as the existence of a winning strategy in the game for the verifier. In a first‐order language, the game‐theoretical truth‐condition of a sentence S can accordingly be expressed by an explicit second‐order sentence asserting the existence of the Skolem function of S.The semantical games of GTS must be distinguished not only from the «games» of formal proof but also from the «games» in volved in our ordinary activities of verification and falsification. The latter have been modelled as games of inquiry by the author, and they are essentially epistemic games where the meaning of truth is taken for granted and where the aim of the game is to come to know certain truths. To assimilate them to the semantical games constitutive of truth is a form of Meno's paradox. (shrink)

We introduce a multimodal logic for order of magnitude reasoning which considers a new logic-based alternative to the notion of closeness, we provide an axiom system and prove its soundness and completeness.

One of the most significant discoveries of early twentieth century mathematical logic was a workable definition of ‘ordered pair’ totally within set theory. Norbert Wiener, and independently Casimir Kuratowski, are usually credited with this discovery. A definition of ‘ordered pair’ held the key to the precise formulation of the notions of ‘relation’ and ‘function’ — both of which are probably indispensable for an understanding of the foundations of mathematics. The set-theoretic definition of ‘ordered pair’ thus turned out to be (...) a key victory for logicism, providing one admits set theory is logic. The definition also was instrumental in achieving the appearance of ontological economy — since it seemed only sets were needed — although this feature was emphasized only later. (shrink)

We present a plural logic that is as expressively strong as it can be without sacrificing axiomatisability, axiomatise it, and use it to chart the expressive limits set by axiomatisability. To the standard apparatus of quantification using singular variables our object-language adds plural variables, a predicate expressing inclusion (is/are/is one of/are among), and a plural definite description operator. Axiomatisability demands that plural variables only occur free, but they have a surprisingly important role. Plural description is not eliminable in favour (...) of quantification; on the contrary, quantification is definable in terms of it. Predicates and functors (function signs) can take plural as well as singular terms as arguments, and both many-valued and single-valued functions are expressible. The system accommodates collective as well as distributive predicates, and the condition for a predicate to be distributive is definable within it; similarly for functors. An essential part of the project is to demonstrate the soundness and completeness of the calculus with respect to a semantics that does without set-theoretic domains and in which the use of settheoretic extensions of predicates and functors is replaced by the sui generis relations and functions for which the extensions were at best artificial surrogates. Our metalanguage is designed to solve the difficulties involved in talking plurally about individuals and about the semantic values of plural items. (shrink)

Inductively defined structures are ubiquitous in mathematics; their specification is unambiguous and their properties are powerful. All fields of mathematical logic feature these structures prominently: the formula of a language, the set of theorems, the natural numbers, the primitive recursive functions, the constructive number classes and segments of the cumulative hierarchy of sets. -/- This dissertation gives a mathematical characterization of a species of inductively defined structures, called accessible domains, which include all of the above examples except the (...) set of theorems. The concept of an accessible domain comes from Wilfried Sieg's analysis of proof-theoretic practices, starting with his dissertation. In particular, he noticed the special epistemological character of elements of an accessible domain: they can always be uniquely identified with their build-up. Generally, the unique build-up of elements justifies the principles of induction and recursion. -/- I use category theory to give an abstract characterization of accessible domains. I claim that accessible domains are all instances of initial algebras for endofunctors. Grounded in the historical roots of Sieg's discussions, this dissertation shows how the properties of initial algebras for endofunctors and accessible domains coincide in a satisfying and natural way. -/- Filling out this characterization, I show how important examples of accessible domains fit into this broad characterization. I first characterize some accessible domains by relatively simple functors (e.g. finite, polynomial, those that preserve certain colimits) where we can see how iterating the functor can produce the accessible domain. Then I describe accessible domains that result from more involved specifications (e.g. ordinals and segments of the cumulative hierarchies associated with CZF, IZF, and ZF) by relying heavily on algebraic set theory. I end with a discussion of some of the methodological features of category theory in particular that helped characterize accessible domains. (shrink)

We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality κ of the family is much larger (in the sense of large cardinals) than the cardinality λ of the set of labels, more precisely if the partition relation holds, then there is a homomorphism from one labeled tree in the family to another. Our proof uses a characterization of such homomorphisms in terms of games.

Introduction. The system of axioms for set theory to be exhibited in this paper is a modification of the axiom system due to von Neumann. In particular it adopts the principal idea of von Neumann, that the elimination of the undefined notion of a property (“definite Eigenschaft”), which occurs in the original axiom system of Zermelo, can be accomplished in such a way as to make the resulting axiom system elementary, in the sense of being formalizable in the logical calculus (...) of first order, which contains no other bound variables than individual variables and no accessory rule of inference (as, for instance, a scheme of complete induction).The purpose of modifying the von Neumann system is to remain nearer to the structure of the original Zermelo system and to utilize at the same time some of the set-theoretic concepts of the Schröder logic and of Principia mathematica which have become familiar to logicians. As will be seen, a considerable simplification results from this arrangement.The theory is not set up as a pure formalism, but rather in the usual manner of elementary axiom theory, where we have to deal with propositions which are understood to have a meaning, and where the reference to the domain of facts to be axiomatized is suggested by the names for the kinds of individuals and for the fundamental predicates.On the other hand, from the formulation of the axioms and the methods used in making inferences from them, it will be obvious that the theory can be formalized by means of the logical calculus of first order (“Prädikatenkalkul” or “engere Funktionenkalkül”) with the addition of the formalism of equality and the ι-symbol for “descriptions” (in the sense of Whitehead and Russell). (shrink)

Most axiomatizations of set theory that have been treated metamathematically have been based either entirely on classical logic or entirely on intuitionistic logic. But a natural conception of the settheoretic universe is as an indefinite (or “potential”) totality, to which intuitionistic logic is more appropriately applied, while each set is taken to be a definite (or “completed”) totality, for which classical logic is appropriate; so on that view, set theory should be axiomatized on some correspondingly mixed (...) basis. Similarly, in the case of predicative analysis, the natural numbers are considered to form a definite totality, while the universe of sets (or functions) of natural numbers are viewed as an indefinite totality, so that, again, a mixed semi-constructive logic should be the appropriate one to treat the two together. Various such semiconstructive systems of analysis and set theory are formulated here and their proof-theoretic strength is characterized. Interestingly, though the logic is weakened, one can in compensation strengthen certain principles in a way that could be advantageous for mathematical applications. (shrink)

"Philosophical logic" describes two distinct areas: the investigation of the fundamental concepts of logic, the formal investigation of alternatives and extensions to classical logic. The first is a philosophical discipline, concerned with notions like truth, propositions, necessity, logical consequence, vagueness, and reasoning. The second is a technical discipline, devoted to developing formal logical systems-modal logics, second-order logics, intuitionistic logics, relevance logics, logics of vagueness and conditionals-and proving things about them. Most texts in philosophical logic focus on (...) one of these areas, but in this book John MacFarlane treats them together in an integrated way, showing how philosophical considerations motivate the technical projects, and how the constraints revealed by the technical projects illuminate the philosophical issues. Topics covered include quantifiers, modal logic, indicative conditionals, model-theoretic and proof-theoretic characterizations of logical consequence, intuitionistic logic, fundamental logical disagreement, relevance logic, the relation of logic and reasoning, and vagueness. Each chapter is organized around suggested readings and includes exercises. Key Features: An integrated treatment of the technical and philosophical issues comprising philosophical logic Written by a leading authority on logicism and logical form and a successful expositor and teacher Designed to serve students taking only one course in logic beyond the introductory level Provides tools and concepts necessary to understand work in many areas of analytic philosophy Includes exercises, suggested readings, and suggestions for further exploration in each chapter. (shrink)