Related papers: Priority arguments via true strages

We present a completeness result for a logical system which combines stit logic and justification logic in order to represent proving activity of the agents. This logic is interpreted over the semantics introduced in earlier publications.…

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…

In this paper, we consider a stabilization problem of a generalized thermoelastic system (the so called $\alpha-\beta$ system) with delay in a part of the coupled system. For each case, we prove the well-posedness of the corresponding…

In measure theory, Steinhaus theorem is a result that deals with a property of the difference between two sets of positive measure. We give a simple elementary proof of the result.

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

Using techniques of projective geometry, we give elementary proofs of two theorems concerning Hagge configurations.

McFadden and Richter (1991) and later McFadden (2005) show that the Axiom of Revealed Stochastic Preference characterizes rationalizability of choice probabilities through random utility models on finite universal choice spaces. This note…

After defining continuous extensions of binary relations on the set N of natural numbers to its Stone-Cech compactification \beta N, we establish some results about one of such extensions. This provides us with one possible divisibility…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

In this paper, we present two methods to provide explanations for reasoning with belief functions in the valuation-based systems. One approach, inspired by Strat's method, is based on sensitivity analysis, but its computation is simpler…

Event Structures (ESs) are mainly concerned with the representation of causal relationships between events, usually accompanied by other event relations capturing conflicts and disabling. Among the most prominent variants of ESs are Prime…

Noether's first theorem does not establish a one-way explanatory arrow from symmetries to conservation laws, but such an arrow is widely assumed in discussions of the theorem in the physics and philosophy literature. It is argued here that…

The connections among natural language processing and argumentation theory are becoming stronger in the latest years, with a growing amount of works going in this direction, in different scenarios and applying heterogeneous techniques. In…

We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic…

The axiomatic system introduced by H\'ajek axiomatizes first-order logic based on BL-chains. In this study, we extend this system with the axiom $(\forall x \phi)^2 \leftrightarrow \forall x \phi^2$ and the infinitary rule \[ \frac{\phi…

We show how to attach to any stratum of a reductive group a (small) finite group. We also show that in the simply laced case the set of strata is in bijection with a subset of the set of almost special representations of the Weyl group.…

In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed…