中文
相关论文

相关论文: Topological Completeness for Higher-Order Logic

200 篇论文

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…

逻辑 · 数学 2025-08-29 Wesley H. Holliday

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

计算机科学中的逻辑 · 计算机科学 2014-12-11 Fred Mesnard , Etienne Payet

A semantic embedding of (constant domain) quantified conditional logic in classical higher-order logic is presented.

人工智能 · 计算机科学 2012-04-27 Christoph Benzmueller , Valerio Genovese

These notes were written for a presentation given at the university Paris VII in January 2012. The goal was to explain a proof of a famous theorem by P. Deligne about coherent topoi (coherent topoi have enough points) and to show how this…

逻辑 · 数学 2013-09-03 Benjamin Frot

We firstly introduce some key concepts in category theory, such as quotient category, completion of limits, $\mathrm{Mor}$ category, and so on; then give the concept of topology algebras and sheaves, and discuss how to restore the structue…

范畴论 · 数学 2019-06-11 Dezhao Zhang

As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…

范畴论 · 数学 2023-04-18 Joshua Wrigley

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

组合数学 · 数学 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

计算机科学中的逻辑 · 计算机科学 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

逻辑 · 数学 2009-09-29 Kai Bruennler

Topological order in strongly correlated systems, including quantum spin liquids, quantum Hall states in lattices and topological superconductivity is treated. Various metallic non-Fermi-liquid states are discussed, including fractionalized…

强关联电子 · 物理学 2022-09-12 V. Yu. Irkhin , Yu. N. Skryabin

While there is a long tradition of reasoning about (non)termination in program analysis, specialized logics are typically needed to give different termination criteria. This includes partial correctness, where termination is not guaranteed,…

计算机科学中的逻辑 · 计算机科学 2025-06-24 James Li , Noam Zilberstein , Alexandra Silva

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

计算机科学中的逻辑 · 计算机科学 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We consider propositional modal logic with two modal operators $\Box$ and $\D$. In topological semantics $\Box$ is interpreted as an interior operator and $\D$ as difference. We show that some important topological properties are…

逻辑 · 数学 2010-11-29 Kudinov Andrey

We introduce the notion of a higher covering diagram in a base $\infty$-category $\mathcal{C}$. The theory of higher covering diagrams in $\mathcal{C}$ will be shown to recover various descent conditions known from the $\infty$-categorical…

范畴论 · 数学 2024-06-04 Raffael Stenzel

Separation logic is used to reason locally about stateful programs. State of the art program logics for higher-order store are usually built on top of untyped operational semantics, in part because traditional denotational methods have…

编程语言 · 计算机科学 2024-02-14 Frederik Lerbjerg Aagaard , Jonathan Sterling , Lars Birkedal

In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from…

量子物理 · 物理学 2009-11-13 Graciela Domenech , Hector Freytes

Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used…

计算机科学中的逻辑 · 计算机科学 2012-06-12 D. J. C. Staudt

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

逻辑 · 数学 2024-08-23 Boris Čulina

Substantial efforts have been made in developing various Decision Modeling formalisms, both from industry and academia. A challenging problem is that of expressing decision knowledge in the context of incomplete knowledge. In such contexts,…

人工智能 · 计算机科学 2023-12-19 Đorđe Marković , Simon Vandevelde , Linde Vanbesien , Joost Vennekens , Marc Denecker

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

逻辑 · 数学 2024-05-22 Carlos Caleiro , Sérgio Marcelino