Sciweavers

265 search results - page 39 / 53
» Weakly Algebraizable Logics
Sort
View
LOGCOM
2002
72views more  LOGCOM 2002»
13 years 8 months ago
Definability in Rationals with Real Order in the Background
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
Yuri Gurevich, Alexander Moshe Rabinovich
ICALP
1998
Springer
14 years 24 days ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
ICFP
2010
ACM
13 years 9 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
JUCS
2008
147views more  JUCS 2008»
13 years 8 months ago
On BCK Algebras - Part I.b: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu
JUCS
2007
100views more  JUCS 2007»
13 years 8 months ago
On BCK Algebras - Part I.a: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu