Szubstrukturális logikák algebrai és bizonyításelméleti vizsgálata = Algebraic and Proof Theoretic Investigations of Substructural Logics

A kutatás fő eredményei: - Az ""Equality"" algebrák bevezetése (Studia Logica). - A ""strongly involutive uninorm"" algebrák bevezetése és osztályozása, valamint a vonatkozó logika komplexitásának vizsgálata (J Logic and Computation). - Az ""involutive FLe-monoid""-ok algebrai vizsgálata; kúp-reprezentáció és egyes véges láncok osztályozása (Archive for Mathematical Logic). - Az involutív uninormák egy osztályának osztályozása, az itt bevezetett ferde-szimmetrizáció segítségével (J Logic and Computation). - A forgatás konstrukció és az Ábel csoportok kapcsolatának vizsgálata (Fuzzy Sets and Systems). - A reziduált hálók geometriai jellegű vizsgálata (Annals of Pure and Applied Logic). Lektorálás alatt: az ""Elnyelő-folytonos, éles, szubreál láncon értelmezett FLe-algebrák osztályozása"" és a ""Pseudo Equality Algebras"" cikkek. | The scientific achievements of the project are the following: - The introducing of equality algebras (Studia Logica). - The introducing and classifying of strongly involutive uninorm algebras along with complexity issues of the related logic (J Logic and Computation). - Algebraic investigation of involutive FLe-monoids, in particular, conic representation and classification of certain finite chains (Archive for Mathematical Logic). - Structural description of a class of involutive uninorms via inrtoducing skew symmetrization (J Logic and Computation). - An investigation of the link between the rotation-construction and Abelian groups (Fuzzy Sets and Systems). - A geometric flavour study of residuated lattices (Annals of Pure and Applied Logic). - ""Classification of absorbent-continuous sharp FLe-algebras over subreal chains"" and Pseudo Equality Algebras"" (two articles under review

On triangular norms and uninorms definable in ŁΠ12

AbstractIn this paper, we investigate the definability of classes of t-norms and uninorms in the logic ŁΠ12. In particular we provide a complete characterization of definable continuous t-norms, weak nilpotent minimum t-norms, conjunctive uninorms continuous on [0,1), and idempotent conjunctive uninorms, and give both positive and negative results concerning definability of left-continuous t-norms (and uninorms). We show that the class of definable uninorms is closed under construction methods as annihilation, rotation and rotation–annihilation. Moreover, we prove that every logic based on a definable uninorm is in PSPACE, and that any finitely axiomatizable logic based on a class of definable uninorms is decidable. Finally we show that the Uninorm Mingle Logic (UML) and the Basic Uninorm Logic (BUL) are finitely strongly standard complete w.r.t. the related class of definable left-continuous conjunctive uninorms

Three-valued logics, uncertainty management and rough sets

This paper is a survey of the connections between three-valued logics and rough sets from the point of view of incomplete information management. Based on the fact that many three-valued logics can be put under a unique algebraic umbrella, we show how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets. We then show that while such translations may provide mathematically elegant algebraic settings for rough sets, the interpretability of these connectives in terms of an original set approximated via an equivalence relation is very limited, thus casting doubts on the practical relevance of truth-functional logical renderings of rough sets

Fitting aggregation operators to data

Theoretical advances in modelling aggregation of information produced a wide range of aggregation operators, applicable to almost every practical problem. The most important classes of aggregation operators include triangular norms, uninorms, generalised means and OWA operators.With such a variety, an important practical problem has emerged: how to fit the parameters/ weights of these families of aggregation operators to observed data? How to estimate quantitatively whether a given class of operators is suitable as a model in a given practical setting? Aggregation operators are rather special classes of functions, and thus they require specialised regression techniques, which would enforce important theoretical properties, like commutativity or associativity. My presentation will address this issue in detail, and will discuss various regression methods applicable specifically to t-norms, uninorms and generalised means. I will also demonstrate software implementing these regression techniques, which would allow practitioners to paste their data and obtain optimal parameters of the chosen family of operators.<br /

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation

In [6], Iemhoff introduced the notion of a focused axiom and a focused rule as the building blocks for a certain form of sequent calculus which she calls a focused proof system. She then showed how the existence of a terminating focused system implies the uniform interpolation property for the logic that the calculus captures. In this paper we first generalize her focused rules to semi-analytic rules, a dramatically powerful generalization, and then we will show how the semi-analytic calculi consisting of these rules together with our generalization of her focused axioms, lead to the feasible Craig interpolation property. Using this relationship, we first present a uniform method to prove interpolation for different logics from sub-structural logics $\mathbf{FL_e}$, $\mathbf{FL_{ec}}$, $\mathbf{FL_{ew}}$ and $\mathbf{IPC}$ to their appropriate classical and modal extensions, including the intuitionistic and classical linear logics. Then we will use our theorem negatively, first to show that so many sub-structural logics including \L_n, $G_n$, $BL$, $R$ and $RM^e$ and almost all super-intutionistic logics (except at most seven of them) do not have a semi-analytic calculus. To investigate the case that the logic actually has the Craig interpolation property, we will first define a certain specific type of semi-analytic calculus which we call PPF systems and we will then present a sound and complete PPF calculus for classical logic. However, we will show that all such PPF calculi are exponentially slower than the classical Hilbert-style proof system (or equivalently $\mathbf{LK+Cut}$). We will then present a similar exponential lower bound for a certain form of complete PPF calculi, this time for any super-intuitionistic logic.Comment: 45 page

Idempotent residuated structures : some category equivalences and their applications

This paper concerns residuated lattice-ordered idempotent commutative monoids that are subdirect products of chains. An algebra of this kind is a generalized Sugihara monoid (GSM) if it is generated by the lower bounds of the monoid identity; it is a Sugihara monoid if it has a compatible involution :. Our main theorem establishes a category equivalence between GSMs and relative Stone algebras with a nucleus (i.e., a closure operator preserving the lattice operations). An analogous result is obtained for Sugihara monoids. Among other applications, it is shown that Sugihara monoids are strongly amalgamable, and that the relevance logic RMt has the projective Beth de nability property for deduction.http://www.ams.org//journals/tran/hb201

Borderline vs. unknown: comparing three-valued representations of imperfect information

International audienceIn this paper we compare the expressive power of elementary representation formats for vague, incomplete or conflicting information. These include Boolean valuation pairs introduced by Lawry and González-Rodríguez, orthopairs of sets of variables, Boolean possibility and necessity measures, three-valued valuations, supervaluations. We make explicit their connections with strong Kleene logic and with Belnap logic of conflicting information. The formal similarities between 3-valued approaches to vagueness and formalisms that handle incomplete information often lead to a confusion between degrees of truth and degrees of uncertainty. Yet there are important differences that appear at the interpretive level: while truth-functional logics of vagueness are accepted by a part of the scientific community (even if questioned by supervaluationists), the truth-functionality assumption of three-valued calculi for handling incomplete information looks questionable, compared to the non-truth-functional approaches based on Boolean possibility–necessity pairs. This paper aims to clarify the similarities and differences between the two situations. We also study to what extent operations for comparing and merging information items in the form of orthopairs can be expressed by means of operations on valuation pairs, three-valued valuations and underlying possibility distributions

The ⊛-composition of fuzzy implications: Closures with respect to properties, powers and families

Recently, Vemuri and Jayaram proposed a novel method of generating fuzzy implications from a given pair of fuzzy implications. Viewing this as a binary operation ⊛ on the set II of fuzzy implications they obtained, for the first time, a monoid structure (I,⊛)(I,⊛) on the set II. Some algebraic aspects of (I,⊛)(I,⊛) had already been explored and hitherto unknown representation results for the Yager's families of fuzzy implications were obtained in [53] (N.R. Vemuri and B. Jayaram, Representations through a monoid on the set of fuzzy implications, fuzzy sets and systems, 247 (2014) 51–67). However, the properties of fuzzy implications generated or obtained using the ⊛-composition have not been explored. In this work, the preservation of the basic properties like neutrality, ordering and exchange principles , the functional equations that the obtained fuzzy implications satisfy, the powers w.r.t. ⊛ and their convergence, and the closures of some families of fuzzy implications w.r.t. the operation ⊛, specifically the families of (S,N)(S,N)-, R-, f- and g-implications, are studied. This study shows that the ⊛-composition carries over many of the desirable properties of the original fuzzy implications to the generated fuzzy implications and further, due to the associativity of the ⊛-composition one can obtain, often, infinitely many new fuzzy implications from a single fuzzy implication through self-composition w.r.t. the ⊛-composition

Sequences of refinements of rough sets: logical and algebraic aspects

In this thesis, a generalization of the classical Rough set theory is developed considering the so-called sequences of orthopairs that we define as special sequences of rough sets. Mainly, our aim is to introduce some operations between sequences of orthopairs, and to discover how to generate them starting from the operations concerning standard rough sets. Also, we prove several representation theorems representing the class of finite centered Kleene algebras with the interpolation property, and some classes of finite residuated lattices (more precisely, we consider Nelson algebras, Nelson lattices, IUML-algebras and Kleene lattice with implication) as sequences of orthopairs. Moreover, as an application, we show that a sequence of orthopairs can be used to represent an examiner's opinion on a number of candidates applying for a job, and we show that opinions of two or more examiners can be combined using operations between sequences of orthopairs in order to get a final decision on each candidate. Finally, we provide the original modal logic SOn with semantics based on sequences of orthopairs, and we employ it to describe the knowledge of an agent that increases over time, as new information is provided. Modal logic Son is characterized by the sequences (\u25a11,\u2026, \u25a1n) and (O1,\u2026, On) of n modal operators corresponding to a sequence (t1,\u2026, tn) of consecutive times. Furthermore, the operator \u25a1i of (\u25a11,\u2026, \u25a1n) represents the knowledge of an agent at time ti, and it coincides with the necessity modal operator of S5 logic. On the other hand, the main innovative aspect of modal logic SOn is the presence of the sequence (O1,\u2026, On), since Oi establishes whether an agent is interested in knowing a given fact at time ti