Sciweavers

827 search results - page 51 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
LFP
1992
78views more  LFP 1992»
13 years 9 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
CADE
2010
Springer
13 years 8 months ago
Classical Logic with Partial Functions
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
Hans de Nivelle
ECAI
2010
Springer
13 years 8 months ago
A constructive conditional logic for access control: a preliminary report
We define an Intuitionistic Conditional Logic for Access Control called CICL . The logic CICL is based on a conditional language allowing principals to be defined as arbitrary form...
Valerio Genovese, Laura Giordano, Valentina Gliozz...
APAL
2008
159views more  APAL 2008»
13 years 7 months ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Topological Observations on Multiplicative Additive Linear Logic
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
André Hirschowitz, Michel Hirschowitz, Tom ...