Related papers: Further Comments on Yablo's Construction
I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…
We consider a special class of periodic continued fractions (called alpha-fractions) and discuss the related algebraic and geometric problems. A classical description of the Jacobi variety of a hyperelliptic curve due to Jacobi naturally…
Consider the statement "Every Yang-Baxter integrable system is defined to be exactly-solvable". To formalise this statement, definitions and axioms are introduced. Then, using a specific Yang-Baxter integrable bosonic system, it is shown…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
We show that conjecture 15 in the article by Rabern et al. is wrong, comment on theorem 24 there, and conclude with some remarks on structures similar to the Yablo construction.
In human consciousness perceptions are distinct or atomistic events despite being perceived by an apparently undivided inner observer. This paper applies both classical (Boolean) and quantum logic to analysis of the Liar paradox which is…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
Current methods for textual analysis rely on data annotated within predefined ontologies, often embedding human bias within black-box models. Despite achieving near-perfect performance, these approaches exploit unstructured, linear pattern…
We propose a simple new combinatorial model to study spaces of acyclic Jacobi diagrams, in which they are identified with algebras of words modulo operations. This provides a starting point for a word-problem type combinatorial…
An acyclic causal structure can be described with directed acyclic graph (DAG), where arrows indicate the possibility of direct causation. The task of learning this structure from data is known as "causal discovery." Diverse populations or…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
I present a dialetheic solution to the Antinomy of the Liar and I evaluate the objection that, if the argument in Curry's paradox is valid, accepting this solution forces us to accept an analogous solution to Curry's, which I show to be…
The fact that the famous Godel incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of logician community.…
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…
The classical Tits construction of the exceptional simple Lie algebras has been extended in a couple of directions by using either Jordan superalgebras or composition superalgebras. These extensions are reviewed here. The outcome has been…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We detail some ways in which the study of three-valued logics of indicative conditionals can be extended by further adding a new truth-value. Our approach heavily relies on twist constructions, which have been already used in the literature…
This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the…
In this article, we propose a new hypothesis testing method for directed acyclic graph (DAG). While there is a rich class of DAG estimation methods, there is a relative paucity of DAG inference solutions. Moreover, the existing methods…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…