2920 search results - page 54 / 584 » Finite information logic |
APAL
2010
13 years 10 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
EACL
2003
ACL Anthology
13 years 11 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
CORR
1998
Springer
13 years 9 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
SLOGICA
2002
13 years 9 months ago
2002
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...