English
Related papers

Related papers: Reasoning about constructive concepts

200 papers

We examine the use of classes to formulate several categorical notions. This leads to two proposals: an explicit structure for working with subobjects, and a hierarchy of $k$-classes. We apply the latter to both ordinary and higher…

Category Theory · Mathematics 2018-07-27 Paul Blain Levy

We define the notion of 2-filtered 2-category and give an explicit construction of the bicolimit of a category valued 2-functor. A category considered as a trivial 2-category is 2-filtered if and only if it is a filtered category, and our…

Category Theory · Mathematics 2021-03-17 Eduardo J. Dubuc , Ross Street

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

We firstly show that the standard interpretation of natural quantification in mathematical logic does not provide a satisfying account of its original richness. In particular, it ignores the difference between generic and distributive…

Logic · Mathematics 2011-07-12 Michele Abrusci , Christian Retoré

We propose a new definition of actual cause, using structural equations to model counterfactuals. We show that the definition yields a plausible and elegant account of causation that handles well examples which have caused problems for…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Judea Pearl

We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…

Logic in Computer Science · Computer Science 2025-06-12 Danel Ahman , Andrej Bauer

Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…

Machine Learning · Computer Science 2023-07-25 Bernhard Ganter , Tom Hanika , Johannes Hirth

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

Logic in Computer Science · Computer Science 2022-09-22 Benedikt Bollig , Arnaud Sangnier , Olivier Stietel

As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…

Logic in Computer Science · Computer Science 2019-08-13 Tsong-Ming Liaw , Simon C. Lin

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure…

Logic in Computer Science · Computer Science 2015-07-01 Philipp Weis , Neil Immerman

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

We study the problem of concept induction in visual reasoning, i.e., identifying concepts and their hierarchical relationships from question-answer pairs associated with images; and achieve an interpretable model via working on the induced…

Computer Vision and Pattern Recognition · Computer Science 2021-08-25 Zhonghao Wang , Kai Wang , Mo Yu , Jinjun Xiong , Wen-mei Hwu , Mark Hasegawa-Johnson , Humphrey Shi

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

Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…

Logic in Computer Science · Computer Science 2010-09-02 Andrew Gacek , Dale Miller , Gopalan Nadathur

Recent developments in the formalisation of quantum causal structures have made it possible to test and compare hypotheses about causal structure empirically, rather than being a-priori assumptions. Such differences in causal structure may…

Quantum Physics · Physics 2026-05-28 Declan Maguire , Fabio Costa

One hundred years after the creation of quantum theory, there is no consensus on the kind of reality that is described by the theory. Here, I attribute the lack of progress to the prevailing interpretative methodology, which invariably…

Quantum Physics · Physics 2026-04-02 Philip Goyal

We propose a new definition of actual causes, using structural equations to model counterfactuals.We show that the definitions yield a plausible and elegant account ofcausation that handles well examples which have caused problems forother…

Artificial Intelligence · Computer Science 2013-01-14 Joseph Y. Halpern , Judea Pearl

Since the quantum field theory treats a system of particles, there must be a distribution which is associated with the system of particles. It means that a meaningful quantity is adjoined in the system of particles. It seems that these…

General Physics · Physics 2008-10-25 Yeong-Shyeong Tsai

We propose new definitions of (causal) explanation, using structural equations to model counterfactuals. The definition is based on the notion of actual cause, as defined and motivated in a companion paper. Essentially, an explanation is a…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Judea Pearl

We contemplate the notion of ambiguity in mathematical discourse. We consider a general method of resolving ambiguity and semantic options for sustaining a resolution. The general discussion is applied to the case of `fraction' which is…

Logic in Computer Science · Computer Science 2026-04-07 Jan A Bergstra , John V Tucker