Zobrazeno 1 - 10
of 30
pro vyhledávání: '"f.3.2, f.4.1"'
Autor:
Seiller, Thomas
This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to complexity theory and so-called implicit computational complexity (IC
Externí odkaz:
http://arxiv.org/abs/1609.07895
Autor:
Selinger, Peter
Publikováno v:
Logical Methods in Computer Science, Volume 8, Issue 3 (August 10, 2012) lmcs:1086
We show that an equation follows from the axioms of dagger compact closed categories if and only if it holds in finite dimensional Hilbert spaces.
Externí odkaz:
http://arxiv.org/abs/1207.6972
Publikováno v:
EPTCS 81, 2012
This volume contains the proceedings of the Sixth Workshop on Logical and Semantic Frameworks with Applications (LSFA 2011). The workshop will be hold in Belo Horizonte, on August 27th 2011. Logical and semantic frameworks are formal languages used t
Externí odkaz:
http://arxiv.org/abs/1203.5423
Autor:
Fiore, Marcelo, Hur, Chung-Kil
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 3 (September 8, 2011) lmcs:1071
We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new equational
Externí odkaz:
http://arxiv.org/abs/1107.3031
Autor:
Honsell, Furio, Lenisa, Marina
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 3 (September 1, 2011) lmcs:703
Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, w
Externí odkaz:
http://arxiv.org/abs/1107.1351
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (February 11, 2011) lmcs:777
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are addi
Externí odkaz:
http://arxiv.org/abs/1012.5803
Autor:
Basaldella, Michele, Terui, Kazushige
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 4 (December 22, 2010) lmcs:1066
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines.
Externí odkaz:
http://arxiv.org/abs/1011.1625
Autor:
Laurent, Olivier
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 4 (October 20, 2010) lmcs:1130
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot's lambda-mu-calculus to represent proofs of first-orde
Externí odkaz:
http://arxiv.org/abs/1009.4400
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 3 (September 9, 2010) lmcs:695
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular lang
Externí odkaz:
http://arxiv.org/abs/1007.3769
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 2 (May 21, 2011) lmcs:804
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written
Externí odkaz:
http://arxiv.org/abs/0906.4315