메뉴 건너뛰기




Volumn 12, Issue 2, 2002, Pages 243-253

Monadic logic of order over naturals has no finite base

Author keywords

Monadic logics; Temporal logics

Indexed keywords

AUTOMATA THEORY; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

EID: 0036538802     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.2.243     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 13
    • 0013360768 scopus 로고    scopus 로고
    • Why so many temporal logics climb up the trees?
    • Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'2000), Bratislava, Slovakia, Aug. 2000, Springer
    • (2000) Lecture Notes in Computer Science , vol.1893 , pp. 629-639
    • Rabinovich, A.1    Maoz, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.