Related papers: Compactness in positive logic
This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…
We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…
We study the centraliser of locally compact group extensions of ergodic probability preserving transformations. New methods establishing ergodicity of group extensions are introduced, and new examples of squashable and non-coalescent group…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…
The strong shape category of compact metrizable spaces (compacta) is very well-studied; extending it to noncompact spaces, however, introduces computational complexity that makes it hard to work with. The fine shape category, as defined by…
We propose a treatment of coordination based on the concepts of functor, argument and subcategorization. Its formalization comprises two parts which are conceptually independent. On one hand, we have extended the feature structure…
In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…
The definition of a mobilized system and its efficiency are introduced. The existence of an optimal (maximally efficient) system is proved by an application of Young measures and compensated compactness.
An extension of an abstract argumentation framework, called collective argumentation, is introduced in which the attack relation is defined directly among sets of arguments. The extension turns out to be suitable, in particular, for…
Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.
We relativize the notion of a compact object in an abelian category with respect to a fixed subclass of objects. We show that the standard closure properties persist to hold in this case. Furthermore, we describe categorical and…
To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling…
We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…
In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…
Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…
This paper develops a {\em qualitative} and logic-based notion of similarity from the ground up using only elementary concepts of first-order logic centered around the fundamental model-theoretic notion of type.
In this article we introduce and study a natural form of expansivity, that we call \textit{metric-independent expansiveness}, for group actions on metrizable spaces. This notion means \textit{expansive with respect to every compatible…
In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…