Baaz, M., HaHjek, P., Montagna, F. and Veith, H., Complexity of t-tautologies (1} 3) 3} 11 Beauquier, D. and Slissenko, A., A" rst order logic for speci" cation of timed algorithms: basic properties and a decidable class (1} 3) 13} 52 [Book Review]

, , , , , , &
Annals of Pure and Applied Logic 113 (399):400 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

2002

DOI

10.1016/s0168-0072(01)00051-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A first order logic for specification of timed algorithms: basic properties and a decidable class.Danièle Beauquier & Anatol Slissenko - 2001 - Annals of Pure and Applied Logic 113 (1-3):13-52.
Periodicity Based Decidable Classes in a First Order Timed Logic.Danièle Beauquier & Anatol Slissenko - 2006 - Annals of Pure and Applied Logic 139 (1):43-73.
Complexity of t-tautologies.Matthias Baaz, Petr Hájek, Franco Montagna & Helmut Veith - 2001 - Annals of Pure and Applied Logic 113 (1-3):3-11.
Three complexity problems in quantified fuzzy logic.Franco Montagna - 2001 - Studia Logica 68 (1):143-152.
Decidable properties for monadic abstract state machines.Daniele Beauquier - 2006 - Annals of Pure and Applied Logic 141 (3):308-319.
Characterization of prime numbers in łukasiewicz's logical matrix.Alexander S. Karpenko - 1989 - Studia Logica 48 (4):465 - 478.
Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.
Satisfiability of formulae with one ∀ is decidable in exponential time.Erich Grädel - 1990 - Archive for Mathematical Logic 29 (4):265-276.
First-order Nilpotent minimum logics: first steps.Matteo Bianchi - 2013 - Archive for Mathematical Logic 52 (3-4):295-316.
Capturing qualia: Higher-order concepts and connectionism.Bryon Cunningham - 2001 - Philosophical Psychology 14 (1):29-41.
Interpolation in fuzzy logic.Matthias Baaz & Helmut Veith - 1999 - Archive for Mathematical Logic 38 (7):461-489.
The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar.Paul John King, Kiril Ivanov Simov & Bjørn Aldag - 1999 - Journal of Logic, Language and Information 8 (1):83-110.

Analytics

Added to PP
2014-03-14

Downloads
13 (#973,701)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references