We obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i.e. Heyting algebras satisfying the prelinearity axiom =1. We achieve this result using ordered partitions of finite sets as a key tool to investigate the category opposite to finitely generated Gödel algebras . We give two applications of our main result. We prove that finitely presented Gödel algebras have free products with amalgamation; and we easily obtain a recursive formula for the cardinality of the free Gödel algebra (...) over a finite number of generators first established by A. Horn. (shrink)

We shall address from a conceptual perspective the duality between algebra and geometry in the framework of the refoundation of algebraic geometry associated to Grothendieck’s theory of schemes. To do so, we shall revisit scheme theory from the standpoint provided by the problem of recovering a mathematical structure A from its representations \ into other similar structures B. This vantage point will allow us to analyze the relationship between the algebra-geometry duality and the structure-semiotics duality. Whereas in classical algebraic geometry (...) a certain kind of rings can be recovered by considering their representations with respect to a unique codomain B, Grothendieck’s theory of schemes permits to reconstruct general rings by considering representations with respect to a category of codomains. The strategy to reconstruct the object from its representations remains the same in both frameworks: the elements of the ring A can be realized—by means of what we shall generally call Gelfand transform—as quantities on a topological space that parameterizes the relevant representations of A. As we shall argue, important dualities in different areas of mathematics can be understood as particular cases of this general pattern. In the wake of Majid’s analysis of the Pontryagin duality, we shall propose a Kantian-oriented interpretation of this pattern. We shall use this conceptual framework to argue that Grothendieck’s notion of functor of points can be understood as a “relativization of the a priori” that generalizes the relativization already conveyed by the notion of domain extension to more general variations of the corresponding domains. (shrink)

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models. The situation can be cast as a formal duality relating two categories of syntax and semantics, mediated by homming into a common dualizing object, in this (...) case 2.In the present work, we generalize the entire arrangement from propositional to first-order logic, using a representation result of Butz and Moerdijk. Boolean algebras are replaced by Boolean categories presented by theories in first-order logic, and spaces of models are replaced by topological groupoids of models and their isomorphisms. A duality between the resulting categories of syntax and semantics, expressed primarily in the form of a contravariant adjunction, is established by homming into a common dualizing object, now Sets, regarded once as a boolean category, and once as a groupoid equipped with an intrinsic topology.The overall framework of our investigation is provided by topos theory. Direct proofs of the main results are given, but the specialist will recognize toposophical ideas in the background. Indeed, the duality between syntax and semantics is really a manifestation of that between algebra and geometry in the two directions of the geometric morphisms that lurk behind our formal theory. Along the way, we give an elementary proof of Butz and Moerdijkʼs result in logical terms. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

Using the Makkai's duality for first-order logic, we characterise effective descent morphisms in 2-categories of pretoposes and Barr-exact categories. In both cases they coincide with conservative morphisms. We show that in those 2-categories the 2-coregular factorisations are exactly quotient-conservative factorisations. We also prove a generalisation of the Makkai duality for pseudoelementary categories.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and "interpretational" equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical literature, including definitional equivalence (...) and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. (shrink)

In recent years, philosophers of science have explored categorical equivalence as a promising criterion for when two theories are equivalent. On the one hand, philosophers have presented several examples of theories whose relationships seem to be clarified using these categorical methods. On the other hand, philosophers and logicians have studied the relationships, particularly in the first order case, between categorical equivalence and other notions of equivalence of theories, including definitional equivalence and generalized definitional equivalence. In this article, I will express (...) some skepticism about categorical equivalence as a criterion of physical equivalence, both on technical grounds and conceptual ones. I will argue that “category structure” likely does not capture the structure of a theory, and discuss some recent work in light of this claim. (shrink)