Sciweavers

LOGCOM
2010
135views more  LOGCOM 2010»
13 years 3 months ago
Bases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly sat...
Emil Jerábek
LOGCOM
2010
87views more  LOGCOM 2010»
13 years 3 months ago
Exemplaric Expressivity of Modal Logics
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ļ...
Bart Jacobs, Ana Sokolova
LOGCOM
2010
102views more  LOGCOM 2010»
13 years 3 months ago
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The ļ¬rst is to present a ļ¬nal coalgebra construction for ļ¬nitary endofunctors on Set that uses a certain subset Lāˆ— of the limit L of the ļ¬rs...
Lawrence S. Moss
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 3 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
LOGCOM
2010
114views more  LOGCOM 2010»
13 years 3 months ago
Admissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity ...
Emil Jerábek
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 3 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to deļ¬ne sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 3 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justiļ¬cation is one of the central concepts in formal models of argumentation. The dialectical deļ¬nition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 3 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of ļ¬rst-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisļ¬ab...
Franco Montagna, Carles Noguera
LOGCOM
2010
75views more  LOGCOM 2010»
13 years 3 months ago
A Proof System for Abstract Non-interference
Roberto Giacobazzi, Isabella Mastroeni
LOGCOM
2010
123views more  LOGCOM 2010»
13 years 3 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...