Revisiting Term Studies in Modern Poly-Cultural and Poly-Lingual Contexts: Methadological Approach

The analysis of the issues in term studies showcases that the scholars’ attempts to come to the unified approach to the definition of the term has not been successful yet. No longer is the academic world seen as numbers of regional scientific schools across geographies. On the contrary, globalisation has significantly affected academia and the respective product of science. The subject matter of the research links to poly-culturalism and poly-lingual communication in the contemporary world of science. It aims at the description of monomial and polynomial – proposed substitutes for set (irreversible) term expressions in languages for specific purposes when digitized. It is suggested that an interdisciplinary dialogue between linguistics in Saussure’s concept and philosophy, psychology, neuroscience, and computer science would ultimately make the world catch up with ICT in the digital era. Robotics, automation of processes are soon to absorb vast domains of specialized knowledge. As formal and logical treatment of language helps employ algebraic tools for linguistic analysis, comparative analysis between terms in terminology and an algebraic expression evidences similarities that may hardly be ignored. Thus, an algorithmic description of terminology could generate an infinite number of products from a finite number of essential elements.

PROOF MINING IN Lp SPACES

We obtain an equivalent implicit characterization of Lp Banach spaces that is amenable to a logical treatment. Using that, we obtain an axiomatization for such spaces into a higher order logical system, the kind of which is used in proof mining, a research program that aims to obtain the hidden computational content of mathematical proofs using tools from mathematical logic. As an aside, we obtain a concrete way of formalizing Lp spaces in positive-bounded logic. The axiomatization is followed by a corresponding metatheorem in the style of proof mining. We illustrate its use with the derivation for this class of spaces of the standard modulus of uniform convexity.

Dialetheists’ Lies About the Liar

Liar-like paradoxes are typically arguments that, by using very intuitive resources of natural language, end up in contradiction. Consistent solutions to those paradoxes usually have difficulties either because they restrict the expressive power of the language, or else because they fall prey to extended versions of the paradox. Dialetheists, like Graham Priest, propose that we should take the Liar at face value and accept the contradictory conclusion as true. A logical treatment of such contradictions is also put forward, with the Logic of Paradox (LP), which should account for the manifestations of the Liar. In this paper we shall argue that such a formal approach, as advanced by Priest, is unsatisfactory. In order to make contradictions acceptable, Priest has to distinguish between two kinds of contradictions, internal and external, corresponding, respectively, to the conclusions of the simple and of the extended Liar. Given that, we argue that while the natural interpretation of LP was intended to account for true and false sentences, dealing with internal contradictions, it lacks the resources to tame external contradictions. Also, the negation sign of LP is unable to represent internal contradictions adequately, precisely because of its allowance of sentences that may be true and false. As a result, the formal account suffers from severe limitations, which make it unable to represent the contradiction obtained in the conclusion of each of the paradoxes.

Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates

In this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count,sum,maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the${\rm QEL}^=_{\cal F}$interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to definesumin terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the${\cal A}\mathit{log}$language, when we restrict to that syntactic fragment.