100 search results - page 14 / 20 » A Schemata Calculus for Propositional Logic |
88
Voted
APIN
1998
14 years 10 months ago
1998
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
109
Voted
ICFP
2005
ACM
15 years 10 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
96
Voted
AAAI
2010
14 years 11 months ago
2010
Approaches to reasoning about knowledge in imperfect information games typically involve an exhaustive description of the game, the dynamics characterized by a tree and the incomp...
113
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
FSS
2006
14 years 10 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...