Sciweavers

1391 search results - page 8 / 279
» Completeness of Neighbourhood Logic
Sort
View
AIML
2008
13 years 9 months ago
Completeness of the finitary Moss logic
We give a sound and complete derivation system for the valid formulas in the finitary version of Moss' coalgebraic logic, for coalgebras of arbitrary type.
Clemens Kupke, Alexander Kurz, Yde Venema
LFCS
2007
Springer
14 years 1 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 11 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
IANDC
2006
77views more  IANDC 2006»
13 years 7 months ago
Weakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
Paulo Mateus, Amílcar Sernadas