Sciweavers

3353 search results - page 141 / 671
» Laver and set theory
Sort
View
APAL
2007
78views more  APAL 2007»
14 years 10 months ago
Partial Horn logic and cartesian categories
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...
Erik Palmgren, Steven J. Vickers
CALCO
2009
Springer
139views Mathematics» more  CALCO 2009»
15 years 4 months ago
Traces, Executions and Schedulers, Coalgebraically
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
Bart Jacobs, Ana Sokolova
LCN
2006
IEEE
15 years 4 months ago
On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
Dijiang Huang
CONCUR
2008
Springer
14 years 11 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
JAPLL
2006
87views more  JAPLL 2006»
14 years 10 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk