Related papers: Lindenbaum Method
Lindenbaum method is named after the Polish logician Adolf Lindenbaum who prematurely and without a clear trace disappeared in the turmoil of the Second World War at the age of about 37. The method is based on the symbolic nature of…
In this paper, we study some classes of logical structures from the universal logic standpoint, viz., those of the Tarski- and the Lindenbaum-types. The characterization theorems for the Tarski- and two of the four different Lindenbaum-type…
The book is devoted to the study of the field of application of the method, which arose from the concept of the Lindenbaum matrix by A. Lindenbaum and the Lindenbaum theorem, within the framework of the concept of a consequence relation by…
The aim of this work is to develop a study from the perspective of Abstract Algebraic Logic of some bilattice-based logical systems introduced in the nineties by Ofer Arieli and Arnon Avron. The motivation for such an investigation has two…
This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…
We find an order-theoretic characterization of the Lindenbaum algebra of intuitionistic propositional logic in n variables.
The aim of this work is to provide a special kind of conservative translation between abstract logics, namely an \textit{abstract Glivenko's theorem}. Firstly we define institutions on the categories of logic, algebraizable logics, and…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…
The paper has a form of a talk on the given topic. It consists of three parts. The first part of the paper contains main notions, the second one is devoted to logical geometry, the third part describes types and isotypeness. The problems…
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…
We extend \L ukasiewicz logic obtaining the infinitary logic $\mathcal{IR}\L$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space. Equivalently, our models are unit intervals in…
In 1929 Jan Lukasiewicz used, apparently for the first time, his Polish notation to represent the operations of formal logic. This is a parenthesis-free notation, which also implies that logical functions are operators preceding the…
Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data…
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other…
In 1969, Per Lindstrom proved his celebrated theorem characterising the first-order logic and established criteria for the first-order definability of formal theories for discrete structures. K. J. Barwise, S. Shelah, J. Vaananen and others…
MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…
This is an exposition of the contributions of L\'aszl\'o Lov\'asz to mathematics and computer science written on the occasion of the bestowal of the Abel Prize~2021 to him. Our survey, of course, cannot be exhaustive. We sketch remarkable…
The first system of many-valued logic was introduced by J. Lukasiewicz, his motivation was of philosophical nature as he was looking for an interpretation of the concepts of possibility and necessity. Since then, plenty of research has been…