Archivio Istituzionale della Ricercahttps://iris.unive.itIl sistema di repository digitale IRIS acquisisce, archivia, indicizza, conserva e rende accessibili prodotti digitali della ricerca.Wed, 21 Oct 2020 22:28:33 GMT2020-10-21T22:28:33Z10671Equational calculi for many-sorted algebras with empty carrier setshttp://hdl.handle.net/10278/23045Titolo: Equational calculi for many-sorted algebras with empty carrier sets
Mon, 01 Jan 1990 00:00:00 GMThttp://hdl.handle.net/10278/230451990-01-01T00:00:00ZUniversal Algebraic Semanticshttp://hdl.handle.net/10278/27366Titolo: Universal Algebraic Semantics
Wed, 01 Jan 1986 00:00:00 GMThttp://hdl.handle.net/10278/273661986-01-01T00:00:00ZIntroducing equational type logichttp://hdl.handle.net/10278/4497Titolo: Introducing equational type logic
Tue, 01 Jan 1991 00:00:00 GMThttp://hdl.handle.net/10278/44971991-01-01T00:00:00ZA graph easy set of mute lambda termshttp://hdl.handle.net/10278/40977Titolo: A graph easy set of mute lambda terms
Wed, 01 Jan 2014 00:00:00 GMThttp://hdl.handle.net/10278/409772014-01-01T00:00:00ZA reduction scema by pre-institution transformationshttp://hdl.handle.net/10278/27367Titolo: A reduction scema by pre-institution transformations
Fri, 01 Jan 1993 00:00:00 GMThttp://hdl.handle.net/10278/273671993-01-01T00:00:00ZEasiness in graph modelshttp://hdl.handle.net/10278/30116Titolo: Easiness in graph models
Abstract: We generalize Baeten and Boerboom’s method of forcing to show that there is a fixed sequence (u_k) k∈Nat of closed (untyped) lambda-terms satisfying the following properties:
(a) For any countable sequence (g_k)k∈Nat of Scott continuous functions (of arbitrary arity) on the power set of an arbitrary countable set, there is a graph model such that (lx.xx)(lx.xx)u_k represents g_k in the model.
(b) For any countable sequence (t_k)k∈Nat of closed lambda-terms there is a graph model that satisfies (lx.xx)(lx.xx)u_k = t_k for all k.
We apply these two results, which are corollaries of a unique theorem, to prove the existence of
(1) a finitely axiomatized lambda-theory L such that the interval lattice constituted by the lambda-theories extending L is distributive;
(2) a continuum of pairwise inconsistent graph theories ( = lambda-theories that can be realized as theories of graph models);
(3) a congruence distributive variety of combinatory algebras (lambda abstraction algebras, respectively).
Sun, 01 Jan 2006 00:00:00 GMThttp://hdl.handle.net/10278/301162006-01-01T00:00:00ZThe abstract variable-binding calculushttp://hdl.handle.net/10278/13807Titolo: The abstract variable-binding calculus
Abstract: STUDIA LOGICA
Sun, 01 Jan 1995 00:00:00 GMThttp://hdl.handle.net/10278/138071995-01-01T00:00:00ZNonmodularity results for lambda calculushttp://hdl.handle.net/10278/13872Titolo: Nonmodularity results for lambda calculus
Mon, 01 Jan 2001 00:00:00 GMThttp://hdl.handle.net/10278/138722001-01-01T00:00:00ZThe variety of lambda abstraction algebras does not admit n-permutable congruences for all nhttp://hdl.handle.net/10278/40976Titolo: The variety of lambda abstraction algebras does not admit n-permutable congruences for all n
Thu, 01 Jan 1998 00:00:00 GMThttp://hdl.handle.net/10278/409761998-01-01T00:00:00ZOn semi-boolean-like algebrashttp://hdl.handle.net/10278/37843Titolo: On semi-boolean-like algebras
Abstract: In a previous paper, we introduced the notion of Boolean-like algebra as a generalisation of Boolean algebras to an arbitrary similarity type. In a nutshell, a double-pointed algebra A with constants 0,1 is Booolean-like in case for all a in A the two congruences generated by the pairs (a,0) and (a,1) respectively are complementary factor congruences of A. We also introduced the weaker notion of semi-Boolean-like algebra, showing that it retained some of the strong algebraic properties characterising Boolean algebras. In this paper, we continue the investigation of semi-Boolean like algebras. In particular, we show that every idempotent semi-Boolean-like variety is term equivalent to a variety of noncommutative Boolean algebras with additional regular operations.
Tue, 01 Jan 2013 00:00:00 GMThttp://hdl.handle.net/10278/378432013-01-01T00:00:00Z