English
Related papers

Related papers: Simple Axioms for Local Properties

200 papers

The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological spaces. An important property of LF spaces satisfying the axioms…

Geometric Topology · Mathematics 2015-03-17 Vladimir Kovalevsky

We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…

Category Theory · Mathematics 2010-04-23 Michael A. Shulman

The paper considers epistemic properties of linear communication chains. It describes a sound and complete logical system that, in addition to the standard axioms of S5 in a multi-modal language, contains two non-trivial axioms that capture…

Logic in Computer Science · Computer Science 2013-10-29 Jeffrey Kane , Pavel Naumov

We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…

Logic in Computer Science · Computer Science 2022-10-20 Tiziano Dalmonte , Marianna Girlando

In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…

Logic in Computer Science · Computer Science 2023-08-01 Óscar Martín , Alberto Verdejo , Narciso Martí-Oliet

In the Lorentz invariant formalism of compact space-time dimensions the assumption of periodic boundary conditions represents a consistent semi-classical quantization condition for relativistic fields. In [arXiv:0903.3680] we have shown,…

High Energy Physics - Theory · Physics 2012-08-20 Donatello Dolce

In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

Combinatorics · Mathematics 2018-08-08 Mohsen Aliabadi , Mano Vikash Janardhanan

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

Logic in Computer Science · Computer Science 2021-06-17 Jan Triska , Vilem Vychodil

Since there are different ways of axiomatizing and developing a mathematical theory, knowledge about a such a theory may reside in many places and in many forms within a library of formalized mathematics. We introduce the notion of a realm…

Mathematical Software · Computer Science 2014-05-26 Jacques Carette , William M. Farmer , Michael Kohlhase

We present a general framework for evaluating image counterfactuals. The power and flexibility of deep generative models make them valuable tools for learning mechanisms in structural causal models. However, their flexibility makes…

Computer Vision and Pattern Recognition · Computer Science 2023-03-03 Miguel Monteiro , Fabio De Sousa Ribeiro , Nick Pawlowski , Daniel C. Castro , Ben Glocker

In this paper we show that states, transitions and behavior of concurrent systems can often be modeled as sheaves over a suitable topological space. In this context, geometric logic can be used to describe which local properties (i.e.…

Logic in Computer Science · Computer Science 2008-10-17 Viorica Sofronie-Stokkermans

The majority of existing post-hoc explanation approaches for machine learning models produce independent, per-variable feature attribution scores, ignoring a critical inherent characteristics of homogeneously structured data, such as visual…

Machine Learning · Computer Science 2023-02-14 Vadim Borisov , Gjergji Kasneci

There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations…

Logic in Computer Science · Computer Science 2013-07-30 Daniel Gebler , Eugen-Ioan Goriac , Mohammad Reza Mousavi

Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…

Artificial Intelligence · Computer Science 2024-12-19 Jesse Heyninck

In this paper, we identify some of the limitations of current-day shape matching techniques. We provide examples of how contour-based shape matching techniques cannot provide a good match for certain visually similar shapes. To overcome…

Computer Vision and Pattern Recognition · Computer Science 2012-12-20 Vittal Premachandran , Ramakrishna Kakarala

Diagram chasing is a customary proof method used in category theory and homological algebra. It involves an element-theoretic approach to show that certain properties hold for a commutative diagram. When dealing with abelian categories for…

Category Theory · Mathematics 2020-10-29 Valentino Vito

We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…

Logic · Mathematics 2021-04-02 Sergey V. Sudoplatov

Property inheritance -- a phenomenon where novel properties are projected from higher level categories (e.g., birds) to lower level ones (e.g., sparrows) -- provides a unique window into how humans organize and deploy conceptual knowledge.…

Computation and Language · Computer Science 2025-03-11 Juan Diego Rodriguez , Aaron Mueller , Kanishka Misra

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

Systematic compositionality is the ability to recombine meaningful units with regular and predictable outcomes, and it's seen as key to humans' capacity for generalization in language. Recent work has studied systematic compositionality in…

Computation and Language · Computer Science 2018-07-20 João Loula , Marco Baroni , Brenden M. Lake