首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Fibered universal algebra for first-order logics
Institution:1. Department of Mathematics, Vanderbilt University, 1326 Stevenson Center Ln, Nashville, TN 37212, United States of America;2. School of Computing, Australian National University, 108 North Rd, Acton ACT 2601, Australia;1. Aix Marseille Univ, CNRS, Marseille, I2M, Marseille, France;2. Institute of Mathematics, Czech Academy of Sciences, ?itná 25, 115 67 Praha 1, Czech Republic;3. Max Planck Institute for Mathematics, Bonn, Germany;4. Department of Mathematics and Statistics, University of Massachusetts Amherst, MA 01003-9305, Amherst, USA;1. School of Mathematical and Physical Sciences, Macquarie University, NSW 2109, Australia;2. Department of Mathematics and Statistics, Masaryk University, Kotlá?ská 2, 611 37 Brno, Czech Republic
Abstract:We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing fibered algebraic semantics for general first-order logics. This framework includes a natural notion of substitution, which allows first-order logics to be considered as structural closure operators just as propositional logics are in abstract algebraic logic. We then establish an extension of the homomorphism theorem from universal algebra for generalized prop-categories and characterize two natural closure operators on the prop-categorical semantics. The first closes a class of structures (which are interpreted as morphisms of prop-categories) under the satisfaction of their common first-order theory and the second closes a class of prop-categories under their associated first-order consequence. It turns out that these closure operators have characterizations that closely mirror Birkhoff's characterization of the closure of a class of algebras under the satisfaction of their common equational theory and Blok and Jónsson's characterization of closure under equational consequence, respectively. These algebraic characterizations of the first-order closure operators are unique to the prop-categorical semantics. They do not have analogues, for example, in the Tarskian semantics for classical first-order logic. The prop-categories we consider are much more general than traditional intuitionistic prop-categories or triposes (i.e., topos representing indexed partially ordered sets). Nonetheless, to the best of our knowledge, our results are new, even when restricted to these special classes of prop-categories.
Keywords:Hyperdoctrine  Prop-category  Categorical logic  Fibred universal algebra  Abstract algebraic logic  General predicate logic  Generalized quantifiers  Birkoff theorem  Blok-Jónsson theorem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号