Sciweavers

CORR
2011
Springer
149views Education» more  CORR 2011»
12 years 8 months ago
Intensionality and Two-steps Interpretations
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Zoran Majkic
CORR
2011
Springer
162views Education» more  CORR 2011»
12 years 12 months ago
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be...
Nick Bezhanishvili, Mai Gehrke
EUROCAST
2009
Springer
153views Hardware» more  EUROCAST 2009»
13 years 2 months ago
Algorithm for Testing the Leibniz Algebra Structure
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
José Manuel Casas, Manuel A. Insua, Manuel ...
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 3 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
MLQ
2002
83views more  MLQ 2002»
13 years 4 months ago
Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
Nick Bezhanishvili
JUCS
2002
108views more  JUCS 2002»
13 years 4 months ago
Heyting Algebras and Formal Languages
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 4 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
FUIN
2002
89views more  FUIN 2002»
13 years 4 months ago
Process Algebra with Nonstandard Timing
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...
Kees Middelburg
EJC
2002
13 years 4 months ago
Bases in Orlik-Solomon Type Algebras
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal (M) generated by the boundaries of the circuits of the matroid. There i...
David Forge
ORDER
2006
128views more  ORDER 2006»
13 years 4 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok