Sciweavers

37 search results - page 2 / 8
» An algebraic approach to subframe logics. Intuitionistic cas...
Sort
View
LICS
2002
IEEE
14 years 15 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CADE
2006
Springer
14 years 8 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
APAL
2010
123views more  APAL 2010»
13 years 7 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
IANDC
2010
102views more  IANDC 2010»
13 years 6 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
ICALP
2001
Springer
14 years 2 days ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto