In this work we study the functions, which are the polynomials of conditional algebra. The notion of conditional algebra is based on the procedural semantics of the conditional operator “if A then B else C” – one of the most usable operators of programming languages.

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...) about branching time. (shrink)

The overwhelming majority of the attempts in exploring the problems related to quantum logical structures and their interpretation have been based on an underlying set-theoretic syntactic language. We propose a transition in the involved syntactic language to tackle these problems from the set-theoretic to the category-theoretic mode, together with a study of the consequent semantic transition in the logical interpretation of quantum event structures. In the present work, this is realized by representing categorically the global structure of a quantum algebra (...) of events (or propositions) in terms of sheaves of local Boolean frames forming Boolean localization functors. The category of sheaves is a topos providing the possibility of applying the powerful logical classification methodology of topos theory with reference to the quantum world. In particular, we show that the topos-theoretic representation scheme of quantum event algebras by means of Boolean localization functors incorporates an object of truth values, which constitutes the appropriate tool for the definition of quantum truth-value assignments to propositions describing the behavior of quantum systems. Effectively, this scheme induces a revised realist account of truth in the quantum domain of discourse. We also include an Appendix, where we compare our topos-theoretic representation scheme of quantum event algebras with other categorial and topos-theoretic approaches. (shrink)

Radical ontic structural realism (ROSR) asserts an ontological commitment to ‘free-standing’ physical structures understood solely in terms of fundamental relations, without any recourse to relata that stand in these relations. Bain ([2013], pp.1621–35) has recently defended ROSR against the common charge of incoherence by arguing that a reformulation of fundamental physical theories in category-theoretic terms (rather than the usual set-theoretic ones) offers a coherent and precise articulation of the commitments accepted by ROSR. In this essay, we argue that category theory (...) does not offer a more hospitable environment to ROSR than set theory. We also show that the application of category-theoretic tools to topological quantum field theory and to algebraic generalizations of general relativity do not warrant the claim that these theories describe ‘object-free’ structures. We conclude that category theory offers little if any comfort to ROSR. 1 Introduction: Ridding Structures of Objects2 The Set-theoretic Peril for Radical Ontic Structural Realism3 Bain’s Categorial Strategy to Save Radical Ontic Structural Realism4 Throwing out the Relations with the Relata5 Categorial and Set-theoretical Structures6 Radical Suggestions from Topological Quantum Field Theory?7 Sheaves of Einstein Algebras as Radical Structures?8 Conclusions. (shrink)

Motivation and perspective for an exciting new research direction interconnecting logic, spacetime theory, relativity--including such revolutionary areas as black hole physics, relativistic computers, new cosmology--are presented in this paper. We would like to invite the logician reader to take part in this grand enterprise of the new century. Besides general perspective and motivation, we present initial results in this direction.

The merits of set theory as a foundational tool in mathematics stimulate its use in various areas of artificial intelligence, in particular intelligent information systems. In this paper, a study of various nonstandard treatments of set theory from this perspective is offered. Applications of these alternative set theories to information or knowledge management are surveyed.

The aim of this paper is to characterize the various structuralist reduction concepts as structure-preserving maps in a succinct and unifying way. To begin with, some important intuitive adequacy conditions are discussed that a good (structuralist) reduction concept should satisfy. Having reconstructed these intuitive conditions in the structuralist framework, it turns out that they divide into two mutually incompatible sets of requirements. Accordingly there exist (at least) two essentially different types of structuralist reduction concepts: the first type stresses the existence (...) of a deductive or inferential link between the reducing and the reduced theory; the second type emphasizes the greater explanatory power the reducing theory should have in comparison with the reduced theory. The problem of the incompatibility of equally plausible reduction concepts is treated in the last section and a proposal is made for its solution consisting in the definition of a multiple synthetizing reduction relation. (shrink)

In this paper (a sequel to [4]) I put forward a "local" interpretation of mathematical concepts based on notions derived from category theory. The fundamental idea is to abandon the unique absolute universe of sets central to the orthodox set-theoretic account of the foundations of mathematics, replacing it by a plurality of local mathematical frameworks - elementary toposes - defined in category-theoretic terms.

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and (...) Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (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)

It is well-established that topos theory is inherently connected with intuitionistic logic. In recent times several works appeared concerning so-called complement-toposes, which are allegedly connected to the dual to intuitionistic logic. In this paper I present this new notion, some of the motivations for it, and some of its consequences. Then, I argue that, assuming equivalence of certain two definitions of a topos, the concept of a complement-classifier is, at least in general and within the conceptual framework of category theory, (...) not appropriately defined. For this purpose, I first analyze the standard notion of a subobject classifier, show its connection with the representability of the functor Sub via the Yoneda lemma, recall some other properties of the internal structure of a topos and, based on these, I critically comment on the notion of a complement-classifier. (shrink)

Given the frequency of human error, it seems rational to believe that some of our own rational beliefs are false. This is the axiom of epistemic modesty. Unfortunately, using standard propositional quantification, and the usual relational semantics, this axiom is semantically inconsistent with a common logic for rational belief, namely KD45. Here we explore two alternative semantics for KD45 and the axiom of epistemic modesty. The first uses the usual relational semantics and bisimulation quantifiers. The second uses a topological semantics (...) and standard propositional quantification. We show the two different semantics validate many of the same formulas, though we do not know whether they validate exactly the same formulas. Along the way we address various philosophical concerns. (shrink)

There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relations hold, entirely eliminated. Category theory seems to be the correct mathematical theory for clarifying conceptual possibilities in this respect. In this theory, objects acquire their identity either by definition, when in defining category we postulate the existence of objects, or formally by the (...) existence of identity morphisms. We show that it is perfectly possible to get rid of the identity of objects by definition, but the formal identity of objects remains as an essential element of the theory. This can be achieved by defining category exclusively in terms of morphisms and identity morphisms and, analogously, by defining category theory entirely in terms of functors and identity functors. With objects and categories eliminated, we focus on the “philosophy of arrows” and the roles various identities play in it. This perspective elucidates a contrast between “set ontology” and “categorical ontology”. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting the (...) notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. I provide a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. I provide a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Pe parcursul anului trecut, la Institutul de Cercetări Economice şi Sociale „Gheorghe Zane” din Iaşi, a avut loc workshopul „Concepte şi argumente în filosofia social-politică. Interpretări şi dezbateri”. Workshopul s-a desfăşurat în cadrul proiectului POSDRU „Societatea bazată pe cunoaştere: cercetări, dezbateri, perspective”. Cartea de faţă este principalul rezultat al acestui workshop. Ea a fost gândită şi propusă spre publicare în primul rând din speranţa că va fi utilă celor care doresc să se iniţieze – sau celor care încearcă să-i iniţieze (...) pe alţii – în teoria şi filosofia social-politică (mai ales cea contemporană). Aceasta cu atât mai mult cu cât, la noi, lucrările de acest tip (fie semnate de autori români, fie traduceri) sunt încă destul de rare. Mă refer aici la lucrările care acordă o atenţie specială (şi) filosofiei politice (teoriei politice normative), nu doar ştiinţei politice sau politologiei (teoriei politice empirice). Dacă cele din urmă apar din ce în ce mai frecvent în ultima vreme, cele dintâi rămân, din păcate, foarte puţine, chiar insuficiente. Cartea nu este nici pe departe una exhaustivă. În ciuda acestui „defect”, cred că ea îşi poate îndeplini totuşi obiectivul fundamental, fie şi numai pentru că oferă analize, prezentări şi comentarii despre câteva dintre cele mai importante concepte şi teorii din teoria socială şi politică recentă. Mai mult, în cadrul ei sunt discutate inclusiv unele concepte sau/şi teorii încă puţin analizate la noi (precum „multiculturalismul”, „dreptatea socială”, „genul” sau „democraţia deliberativă”). Se obişnuieşte uneori ca autorul introducerii unui volum de acest tip să prezinte în rezumat şi principalele idei apărate sau/şi metodologii utilizate de autorii fiecăruia dintre capitole. Eu nu voi face acest lucru. Motivul? Aş risca să fiu redundant, de vreme ce astfel de precizări şi rezumate au fost deja realizate de autorii volumului, chiar în debutul capitolelor pe care le semnează. Acestea fiind spuse, ţin să mai evidenţiez doar un singur lucru: aşa cum se va observa cu siguranţă, multe dintre capitolele lucrării nu sunt simple texte introductive (deşi au, fără îndoială, şi o astfel de dimensiune). Altfel spus, autorii acestor capitole nu s-au mulţumit să prezinte doar ideile, argumentele sau teoriile altor autori (şi în special ale celor consideraţi de referinţă) în problemele pe care le analizează. De multe ori, ei prezintă, dimpotrivă, şi idei, opinii, interpretări, argumente, perspective sau chiar teorii ori măcar „semiteorii” proprii asupra conceptelor şi problemelor pe care le abordează. Acest lucru nu ar trebui să fie surprinzător. Pentru fiecare dintre autorii capitolelor din acest volum, conceptele şi problemele pe care le prezintă aici constituie o preocupare sistematică şi constantă, dacă nu chiar preocuparea lor fundamentală, cel puţin în ultimii ani. De altfel, cel puţin în România, preocupările şi contribuţiile în domeniu ale multora dintre ei sunt deja cunoscute şi comentate, fie şi doar în cercul restrâns al specialiştilor şi al celor interesaţi de teoria social-politică. (shrink)

A fruitful direction for research on the European cultural heritage is to adopt a transnational approach. Rather than see cultural heritage as predominantly expressed in national contexts, it could be seen as primarily transnational and as plural. Such a view would also suggest a conception of national histories as themselves products of transnational encounters. In this perspective, the European dimension is not then necessarily something over and above nations, but part of their heritage. Moreover, as fundamentally transnational, the European heritage (...) is not exclusively confined to Europe. Cultural heritage is not something that is fixed or based on an essence; it is produced and reinterpreted by social actors in different but overlapping contexts. This is also an interpretative approach that draws attention to the entangled nature of memories and especially the cultural logic by which new conceptions and narratives of heritage emerge from the encounter and entanglement of different memories. Such an approach offers new opportunities for comparative research on the European heritage as an entangled mosaic of histories and memories. This approach thus rejects not only particularistic but also universalistic ones such as alternative Eurocentric accounts. (shrink)

This paper considers a topos-theoretic structure for the interpretation of co-constructive logic for proofs and refutations following Trafford :22–40, 2015). It is notoriously tricky to define a proof-theoretic semantics for logics that adequately represent constructivity over proofs and refutations. By developing abstractions of elementary topoi, we consider an elementary topos as structure for proofs, and complement topos as structure for refutation. In doing so, it is possible to consider a dialogue structure between these topoi, and also control their relation such (...) that classical logic is simulated where proofs and refutations are conclusive. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...) many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

We show that the variety of weakly representable relation algebras is neither canonical nor closed under Monk completions.

The language of standard propositional modal logic has one operator (? or ?), that can be thought of as being determined by the quantifiers ? or ?, respectively: for example, a formula of the form ?F is true at a point s just in case all the immediate successors of s verify F.This paper uses a propositional modal language with one operator determined by a generalized quantifier to discuss a simple connection between standard invariance conditions on modal formulas and generalized (...) quantifiers: the combined generalized quantifier conditions of conservativity and extension correspond to the modal condition of invariance under generated submodels, and the modal condition of invariance under bisimulations corresponds to the generalized quantifier being a Boolean combination of ? and ? (shrink)

Interpreting the diamond of modal logic as the derivative, we present a topological canonical model for extensions of K4 and show completeness for various logics. We also show that if a logic is topologically canonical, then it is relationally canonical.

The notion of that information is relative to a context is important in many different ways. The idea that the context is small — that is, not necessarily a consistent and complete possible world — plays a role not only in situation theory, but it is also an enlightening perspective from which to view other areas, such as modal logics, relevant logics, categorial grammar and much more. In this article we will consider these areas, and focus then on one further (...) question: How can we account for information about one thing giving us information about something else? This is a question addressed by channel theory. We will look at channel theory and then see how the issues of information flow and conditionality play a role in each of the different domains we have examined. (shrink)

The aim of this paper is to provide a logic-based conceptual analysis of the twin paradox (TwP) theorem within a first-order logic framework. A geometrical characterization of TwP and its variants is given. It is shown that TwP is not logically equivalent to the assumption of the slowing down of moving clocks, and the lack of TwP is not logically equivalent to the Newtonian assumption of absolute time. The logical connection between TwP and a symmetry axiom of special relativity is (...) also studied. (shrink)

The purpose of this paper is to justify the claim that Topos theory and Logic (the latter interpreted in a wide enough sense to include Model theory and Set theory) may interact to the advantage of both fields. Once the necessity of utilizing toposes (other than the topos of Sets) becomes apparent, workers in Topos theory try to make this task as easy as possible by employing a variety of methods which, in the last instance, find their justification in metatheorems (...) from Logic. Some concrete instances of this assertion will be given in the form of simple proofs that certain theorems of Algebra hold in any (Grothendieck) topos, in order to illustrate the various techniques that are used. In the other direction, Topos theory can also be a useful tool in Logic. Examples of this are independence proofs in (classical as well as intuitionistic) Set theory, as well as transfer methods in the presence of a sheaf representation theorem, the latter applied, in particular, to model theoretic properties of certain theories. (shrink)

This paper is an introduction to topos theory which assumes no prior knowledge of category theory. It includes a discussion of internal logic in a topos, A characterization of the category of sets, And an investigation of the notions of topology and sheaf in a topos.

This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.

Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (including the Compactness theorem, Saturation and Ehrenfeucht games). Moreover, we consider what happens to this (...) general theory when one restricts attention to special classes of transition systems (in particular, finite ones), as well as extended logical languages (in particular, infinitary first-order logic). We hope that this puts standard logical formalisms on the map as a serious option for a theory of computational processes. As a side benefit, our approach increases comparability with several other existing formalisms over labeled transition systems (such as Process Algebra or Modal Logic). We provide some pointers to this effect, too. (shrink)

I present a version of Kit Fine's stratified semantics for the logic RWQ and define a natural family of related structures called RW hyperdoctrines. After proving that RWQ is sound with respect to RW hyperdoctrines, we show how to construct, for each stratified model, a hyperdoctrine that verifies precisely the same sentences. Completeness of RWQ for hyperdoctrinal semantics then follows from completeness for stratified semantics, which is proved in an appendix. By examining the base category of RW hyperdoctrines, we find (...) reason to be worried about the ontology of stratified models. (shrink)

In the paper we discuss the problem of limitations of freedom in mathematics and search for criteria which would differentiate the new concepts stemming from the historical ones from the new concepts that have opened unexpected ways of thinking and reasoning. We also investigate the emergence of category theory and its origins. In particular we explore the origins of the term functor and present the strong evidence that Eilenberg and Carnap could have learned the term from Kotarbiński and Tarski.

We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of (...) varying strength. For all presented calculi a constructive cut elimination is provided. (shrink)

Special relativity theory is generalized to two or more “maximal” signalling speeds. This framework is discussed in three contexts: (i) as a scenario for superluminal signalling and motion, (ii) as the possibility of two or more “light” cones due to the a “birefringent” vacuum, and (iii) as a further extension of conventionality beyond synchrony.

Classical modal logics, based on the neighborhood semantics of Scott and Montague, provide a generalization of the familiar normal systems based on Kripke semantics. This paper defines AGM revision operators on several first-order monotonic modal correspondents, where each first-order correspondence language is defined by Marc Pauly’s version of the van Benthem characterization theorem for monotone modal logic. A revision problem expressed in a monotone modal system is translated into first-order logic, the revision is performed, and the new belief set is (...) translated back to the original modal system. An example is provided for the logic of Risky Knowledge that uses modal AGM contraction to construct counter-factual evidence sets in order to investigate robustness of a probability assignment given some evidence set. A proof of correctness is given. (shrink)

A history of the logic of action is outlined, beginning with St Anselm. Five modern authors are discussed in some detail: von Wright, Fitch, Kanger, Chellas and Pratt.

The view that toposes originated as generalized set theory is a figment of set theoretically educated common sense. This false history obstructs understanding of category theory and especially of categorical foundations for mathematics. Problems in geometry, topology, and related algebra led to categories and toposes. Elementary toposes arose when Lawvere's interest in the foundations of physics and Tierney's in the foundations of topology led both to study Grothendieck's foundations for algebraic geometry. I end with remarks on a categorical view of (...) the history of set theory, including a false history plausible from that point of view that would make it helpful to introduce toposes as a generalization from set theory. (shrink)

The tangle modality is a propositional connective that extends basic modal logic to a language that is expressively equivalent over certain classes of finite frames to the bisimulation-invariant fragments of both first-order and monadic second-order logic. This paper axiomatises several logics with tangle, including some that have the universal modality, and shows that they have the finite model property for Kripke frame semantics. The logics are specified by a variety of conditions on their validating frames, including local and global connectedness (...) properties. Some of the results have been used to obtain completeness theorems for interpretations of tangled modal logics in topological spaces. (shrink)

L’article montre d’abord jusqu’où convergent la dialectique hégélienne de l’Idée et la dialectique lautmanienne des Idées, et ce sur quoi elles se séparent en profondeur : sur la négativité et le statut de la contradiction. Il s’intéresse ensuite à certaines formalisations qui ont été proposées de ces deux dialectiques : celle de Doz et Dubarle pour Hegel dans une extension de la logique booléenne, et celle, récemment esquissée par F. Zalamea en théorie des catégories, pour Lautman. Est montré dans ses (...) grandes lignes comment la traductibilité mutuelle, au niveau technique, peut être établie entre les deux entreprises, la conséquence étant que la divergence spéculative semble rétroactivement gommée, que le négatif semble avoir disparu. À partir de ce paradoxe sont présentées quelques pistes de réflexion sur les enjeux de la démarche de formalisation, entendue comme entreprise de réduction du fossé existant entre le conceptuel et le formel, et de ce qu’elle révèle des rapports entre mathématiques et philosophie.The paper begins by showing what is common to Hegel’s dialectic of the Idea and Lautman’s dialectic of Ideas, and where they diverge deeply : on negativity and the status of contradiction. It then focuses on two different attempts to formalize these dialectics : Doz and Dubarle’s attempt to formalize the Hegelian one in an extension of Boolean logic ; and, more recently, Zalamea’s formalization of the Lautmanian one through category theory. The paper then sketches how, at a technical level, these two attempts can be translated one into the other — which indicates, in turn, that the speculative divergence seems to have disappeared, that the negative has been erased. With reference to this paradox the paper provides the reader with some reflections dealing with the stakes of the formalizing process, seen as way of reducing the gap existing between the conceptual and the definite, and of what it reveals of the relations between mathematics and philosophy. (shrink)

We introduce the equational notion of a monadic bounded algebra (MBA), intended to capture algebraic properties of bounded quantification. The variety of all MBA's is shown to be generated by certain algebras of two-valued propositional functions that correspond to models of monadic free logic with an existence predicate. Every MBA is a subdirect product of such functional algebras, a fact that can be seen as an algebraic counterpart to semantic completeness for monadic free logic. The analysis involves the representation of (...) MBA's as powerset algebras of certain directed graphs with a set of "marked" points. It is shown that there are only countably many varieties of MBA's, all are generated by their finite members, and all have finite equational axiomatisations classifying them into fourteen kinds of variety. The universal theory of each variety is decidable. Finitely generated MBA's are shown to be finite, with the free algebra on r generators having exactly $2^{3.2^{r.} } ^{2^{{\rm{2}}^{{\rm{r - 1}}} } } $ elements. An explicit procedure is given for constructing this freely generated algebra as the powerset algebra of a certain marked graph determined by the number r. (shrink)

modality , understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language L by interpreting L in dynamic topological systems, i.e. ordered pairs X, f , where X is a topological space and f is a..

The present paper shows how one might model Everettian quantum mechanics using hyperfinitely many worlds. A hyperfinite model allows one to consider idealized measurements of observables with continuous-valued spectra where different outcomes are associated with possibly infinitesimal probabilities. One can also prove hyperfinite formulations of Everett’s limiting relative-frequency and randomness properties, theorems he considered central to his formulation of quantum mechanics. Finally, this model provides an intuitive framework in which to consider no-collapse formulations of quantum mechanics more generally.

In this paper, we advocate the usage of the family of Heyting-valued modal logics, introduced by M. Fitting, by presenting a simple 3-valued modal language and axiomatizing an interesting 3-valued logic of belief. We give two simple bisimulation relations for the modal language, one that respects non-falsity and one that respects the truth value. The doxastic logic axiomatized, apart from being interesting in its own right for KR applications, it comes with an underlying 3-valued propositional logic which is a syntactic (...) variant of the ‘logic of here-and-there’, whose importance in KR and Logic Programming is well-known, it is endowed from its very inception with a Gentzen-style proof theory from [Fit92] and a completeness theorem from [KNP02], it can be equivalently seen as a logic describing the epistemic agreement of two interrelated agents: a K45 agent who ‘dominates’ an S5 agent, as we show here, its satisfiability problem is NP-complete, i.e. at the lower level one can expect for applied logics. This is the first concrete example of an epistemic logic from Fitting's framework, that has been overlooked hitherto, despite its many attractive characteristics. (shrink)