Sciweavers

532 search results - page 24 / 107
» The Logic of Quasi-MV Algebras
Sort
View
JSW
2006
82views more  JSW 2006»
13 years 9 months ago
Incremental Implementation of Syntax Driven Logics
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...
JUCS
2006
126views more  JUCS 2006»
13 years 9 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins
JSYML
2006
124views more  JSYML 2006»
13 years 9 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono
BIRTHDAY
2005
Springer
14 years 3 months ago
Fibring Logics: Past, Present and Future
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
Carlos Caleiro, Amílcar Sernadas, Cristina ...
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 10 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin