Related papers: Further Comments on Yablo's Construction

As a contribution to metaphor analysis, we introduce a statistical, data-based investigation with empirical analysis of long-standing conjectures and a first-ever empirical exploration of the systematic features of metaphors. Conversely,…

We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…

Covering Algebras of extended affine Lie algebras(EALA's) relative to finite order automorphisms are studied. Conditions are given for when the resulting algebra is again an EALA. This paper deals with affinizations of EALA's relative to…

The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

In this paper we introduce the quadratic Jaco graph. The characteristics, properties and some graph invariants of quadratic Jaco graphs are discussed. The observation that quadratic Jaco graphs are well-defined in respect of complete graphs…

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

We give an algebraic presentation of directed acyclic graph structure, introducing a symmetric monoidal equational theory whose free PROP we characterise as that of finite abstract dags with input/output interfaces. Our development provides…

In this paper, we present some generalizations of Lagrange's theorem in the classical theory of continued fractions motivated by the geometric interpretation of the classical theory in terms of closed geodesics on the modular curve. As a…

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Classes of linguistic paradoxes and linguistic tautologies are introduced with examples and explanations. They are part of the author's work on the Paradoxist Philosophy based on mathematical logic. The general cases exposed below are…

We observe several facts and make conjectures about commutative algebras satisfying the Jacobi identity. The central question is which of those algebras admit a faithful representation (i.e., in Lie parlance, satisfy the Ado theorem, or, in…

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

Over the past decade, a number of quantum processes have been proposed which are logically consistent, yet feature a cyclic causal structure. However, there is no general formal method to construct a process with an exotic causal structure…