226 search results - page 13 / 46 » Extensional Theories and Rewriting |
CORR
2007
Springer
15 years 13 days ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
105
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
106
Voted
CADE
2006
Springer
16 years 23 days ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
84
Voted
JSYML
2006
15 years 12 days ago
2006
It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-...
102
click to vote
MSCS
2008
15 years 12 days ago
2008
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...