1101 search results - page 112 / 221 » Forcing in proof theory |
76
Voted
AMAI
2002
Springer
15 years 17 days ago
2002
Springer
Argumentation is a reasoning model based on the construction of arguments and counterarguments (defeaters) then the selection of the most acceptable of them. In this paper, we pro...
99
Voted
COMBINATORICS
1998
15 years 12 days ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
81
Voted
JOLLI
2002
15 years 11 days ago
2002
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
119
Voted
CADE
2012
Springer
13 years 3 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
140
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...