Sciweavers

13 search results - page 2 / 3
» Algebraically Expandable Classes of Implication Algebras
Sort
View
AML
2006
83views more  AML 2006»
13 years 6 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
CIE
2006
Springer
13 years 8 months ago
Do Noetherian Modules Have Noetherian Basis Functions?
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
Peter Schuster, Júlia Zappe
IJAR
2008
143views more  IJAR 2008»
13 years 6 months ago
A characterization of interval-valued residuated lattices
As is well-known, residuated lattices (RLs) on the unit interval correspond to leftcontinuous t-norms. Thus far, a similar characterization has not been found for RLs on the set o...
Bart Van Gasse, Chris Cornelis, Glad Deschrijver, ...
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 4 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 1 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic