New answers tagged reference-request
1
vote
A proof of the completeness of PLTL (Propositional Linear Temporal Logic)
The proof system "DUX" in On the temporal analysis of fairness. D Gabbay, A Pnueli, S Shelah, J Stavi. POPL 1980 is perhaps closest to what you're after. Being a conference paper, the ...
- 480
Top 50 recent answers are included
Related Tags
reference-request × 999algorithms × 210
complexity-theory × 110
graphs × 83
optimization × 59
terminology × 51
formal-languages × 49
data-structures × 43
machine-learning × 41
programming-languages × 37
np-complete × 33
books × 30
automata × 28
logic × 28
time-complexity × 27
computational-geometry × 25
type-theory × 25
education × 25
history × 25
computability × 23
finite-automata × 22
artificial-intelligence × 21
parallel-computing × 21
satisfiability × 20
approximation × 20