1549 search results - page 186 / 310 » On the rules of intermediate logics |
IJCAI
1989
13 years 10 months ago
1989
It is argued that Ginsberg's Possible Worlds Approach to counterfactual implication suffers from a number of defects which are the result of confusing proof theory and model ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
ACTA
1998
13 years 8 months ago
1998
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
RSCTC
2004
Springer
14 years 2 months ago
2004
Springer
The theory of rough sets and formal concept analysis are compared in a common framework based on formal contexts. Different concept lattices can be constructed. Formal concept ana...