English
Related papers

Related papers: Enriched positive logic

200 papers

The logic of reason-based preference advanced in Osherson and Weinstein (2012) is extended to quantifiers. Basic properties of the new system are discussed.

Logic in Computer Science · Computer Science 2012-10-05 Daniel Osherson , Scott Weinstein

With the aim of developing the concepts of positive logic and in response to a question that was asked by Poizat in one of his articles, I wrote this article. The main topic is the study of compactness in the extension as a compact…

Logic · Mathematics 2018-12-24 Mohammed Belkasmi

We define and study the notion of a locally bounded enriched category over a (locally bounded) symmetric monoidal closed category, generalizing the locally bounded ordinary categories of Freyd and Kelly. In addition to proving several…

Category Theory · Mathematics 2022-04-27 Rory B. B. Lucyshyn-Wright , Jason Parker

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

The formal construction of the second-order logic or predicate calculus essentially adds quantifiers to propositional logic. Why second-order logic cannot be reduced to that of the first order? How to demonstrate that certain predicates are…

Logic · Mathematics 2012-02-16 Hector Zenil

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

We generalize Barr's embedding theorem for regular categories to the context of enriched categories.

Category Theory · Mathematics 2009-08-31 Dimitri Chikhladze

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Logic · Mathematics 2019-08-06 Matthias Baaz , Richard Zach

We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…

Logic in Computer Science · Computer Science 2025-02-24 Achim Blumensath

Enriched motivic $\mathcal A$-spaces are introduced and studied in this paper, where $\mathcal A$ is an additive category of correspondences. They are linear counterparts of motivic $\Gamma$-spaces. It is shown that rational special…

Algebraic Topology · Mathematics 2023-10-27 Peter Bonart

The goal of this article is to emphasize the role of cubical sets in enriched categories theory and infinity-categories theory. We show in particular that categories enriched in cubical sets provide a convenient way to describe many…

Category Theory · Mathematics 2021-04-21 Brice Le Grignou

A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with…

Logic · Mathematics 2017-01-11 Erik Palmgren

We make Hinich's $\infty$-categorical enriched Yoneda embedding natural. To do so, we exhibit it as the unit of a partial adjunction between the functor taking enriched presheaves and Heine's functor taking a tensored category to an…

Category Theory · Mathematics 2024-07-09 Shay Ben-Moshe

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.

Logic · Mathematics 2012-02-24 Fredrik Engström , Juha Kontinen

In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…

Logic in Computer Science · Computer Science 2022-07-20 Ján Komara

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

General Mathematics · Mathematics 2025-05-19 Barreto Joaquim Reizi

The present paper addresses several puzzles related to the Rule of Existential Generalization, (EG). In solution to these puzzles from the viewpoint of simple type theory, I distinguish (EG) from a modified Rule of Existential Quantifier…

Logic in Computer Science · Computer Science 2022-04-15 Jiří Raclavský

When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson…

Logic in Computer Science · Computer Science 2019-05-23 David A. Plaisted

We provide a diagrammatic criterion for the existence of an absolute colimit in the context of enriched category theory.

Category Theory · Mathematics 2014-10-02 Richard Garner

Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically…

Logic in Computer Science · Computer Science 2011-10-18 Russell O'Connor
‹ Prev 1 4 5 6 7 8 10 Next ›