Logics of Time and Computation
Csli (1992)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Buy the book | $25.87 new (14% off) $28.50 direct from Amazon (5% off) Amazon page | |||||||||
| ISBN(s) | 0937073946 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesArnon Avron & Beata Konikowska (2009). Proof Systems for Reasoning About Computation Errors. Studia Logica 91 (2):273 - 293.
Valentin Goranko & Wojciech Jamroga (2004). Comparing Semantics of Logics for Multi-Agent Systems. Synthese 139 (2):241 - 280.
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4).
J. Makowsky & Y. Pnueli (1995). Computable Quantifiers and Logics Over Finite Structures. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
Tadeusz Litak & Frank Wolter (2005). All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-Complete. Studia Logica 81 (2):153 - 165.
Juliana Bueno-Soler (2013). Multimodal Incompleteness Under Weak Negations. Logica Universalis 7 (1):21-31.
Roberto Ciuni & Alberto Zanardo (2010). Completeness of a Branching-Time Logic with Possible Choices. Studia Logica 96 (3):393-420.
Selmer Bringsjord (1994). Computation, Among Other Things, is Beneath Us. Minds and Machines 4 (4):469-88.
M. Krynicki, M. Mostowski & L. Szczerba (eds.) (1995). Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
Andrew Boucher (1997). Parallel Machines. Minds and Machines 7 (4):543-551.
Nir Fresco (forthcoming). Explaining Computation Without Semantics: Keeping It Simple. Minds and Machines.
M. A. (2003). A Quantum Computer Only Needs One Universe. Studies in History and Philosophy of Science Part B 34 (3):469-478.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-03-20Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
