1101 search results - page 82 / 221 » Forcing in proof theory |
APAL
2008
15 years 21 days ago
2008
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
112
Voted
JCSS
2008
15 years 17 days ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
CORR
2000
Springer
15 years 12 days ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
92
Voted
APAL
2007
15 years 21 days ago
2007
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
91
Voted
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper a dynamic contact model is presented based on the Johnson-Kendall-Roberts (JKR) theory. The classical JKR model captures the contact properties for the quasi-stat...