Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1706.08481

Translations: generalizing relative expressiveness between logics

Diego Pinheiro Fernandes
View original source ↗Read source document ↗Export metadata ↓

Abstract

There is a strong demand for precise means for the comparison of logics in terms of expressiveness both from theoretical and from application areas. The aim of this paper is to propose a sufficiently general and reasonable formal criterion for expressiveness, so as to apply not only to model-theoretic logics, but also to Tarskian and proof-theoretic logics. For model-theoretic logics there is a standard framework of relative expressiveness, based on the capacity of characterizing structures, and a straightforward formal criterion issuing from it. The problem is that it only allows the comparison of those logics defined within the same class of models. The urge for a broader framework of expressiveness is not new. Nevertheless, the enterprise is complex and a reasonable model-theoretic formal criterion is still wanting. Recently there appeared two criteria in this wider framework, one from Garc\'ia-Matos & V\"a\"an\"anen and other from L. Kuijer. We argue that they are not adequate. Their limitations are analyzed and we propose to move to an even broader framework lacking model-theoretic notions, which we call "translational expressiveness". There is already a criterion in this later framework by Mossakowski et al., however it turned out to be too lax. We propose some adequacy criteria for expressiveness and a formal criterion of translational expressiveness complying with them is given.

Explore related subjects

math.LOcs.LO

Keep this discovery

BibTeXRIS

Diego Pinheiro Fernandes. 2017-06-26. Translations: generalizing relative expressiveness between logics. https://arxiv.org/abs/1706.08481

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗