相关论文: Algebraic and logistic investigations on free latt…

Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The Journal of Symbolic Logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…

We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…

Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…

We present a manuscript of Paul Lorenzen that provides a proof of consistency for elementary number theory as an application of the construction of the free countably complete pseudocomplemented semilattice over a preordered set. This…

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

Unbounded entailment relations, introduced by Paul Lorenzen (1951), are a slight variant of a notion which plays a fundamental r\^ole in logic (see Scott 1974) and in algebra (see Lombardi and Quitt\'e 2015). We call systems of ideals their…

This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a…

In 1955, Paul Lorenzen is a mathematician who devotes all his research to foundations of mathematics, on a par with Hans Hermes, but his academic background is algebra in the tradition of Helmut Hasse and Wolfgang Krull. This shift from…

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…

In sequent calculi, cut elimination is a property that guarantees that any provable formula can be proven analytically. For example, Gentzen's classical and intuitionistic calculi LK and LJ enjoy cut elimination. The property is less…

In this paper we study some fragments without implications of the (Hilbert) full Lambek logic $\mathbf{HFL}$ and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an…

Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…

Recent published work has addressed the Shalqvist correspondence problem for non-distributive logics. The natural question that arises is to identify the fragment of first-order logic that corresponds to logics without distribution, lifting…

In their seminal paper Birkhoff and von Neumann revealed the following dilemma: "... whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics…

We investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the…

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…