351 search results - page 11 / 71 » Classical Logic with Partial Functions |
SIAMCOMP
2008
14 years 9 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
GLVLSI
2007
IEEE
15 years 3 months ago
2007
IEEE
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
100
click to vote
TYPES
2000
Springer
15 years 1 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
SCAI
2001
14 years 11 months ago
2001
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...