183 search results - page 9 / 37 » Applied Logic without Psychologism |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
FSS
2006
13 years 7 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...
TCS
2010
13 years 6 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...