Weakly Definable Relations and Special Automata

Journal of Symbolic Logic 40 (4):622-623 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271833

Links

PhilArchive



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

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

Review: Michael O. Rabin, Weakly Definable Relations and Special Automata. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):622-623.
Topological properties of sets definable in weakly o-minimal structures.Roman Wencel - 2010 - Journal of Symbolic Logic 75 (3):841-867.
A weakly definable type which is not definable.James H. Schmerl - 1993 - Archive for Mathematical Logic 32 (6):463-468.
On the Boolean algebras of definable sets in weakly o‐minimal theories.Stefano Leonesi & Carlo Toffalori - 2004 - Mathematical Logic Quarterly 50 (3):241-248.
Filling certain cuts in discrete weakly o-minimal structures.Stefano Leonesi & Carlo Toffalori - 2005 - Mathematical Logic Quarterly 51 (2):145.
On properties of (weakly) small groups.Cédric Milliet - 2012 - Journal of Symbolic Logic 77 (1):94-110.
A note on stable sets, groups, and theories with NIP.Alf Onshuus & Ya'acov Peterzil - 2007 - Mathematical Logic Quarterly 53 (3):295-300.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
Logics with disjunction and proof by cases.San-min Wang & Petr Cintula - 2008 - Archive for Mathematical Logic 47 (5):435-446.
Expansion of a model of a weakly o-minimal theory by a family of unary predicates.Bektur Sembiuly Baizhanov - 2001 - Journal of Symbolic Logic 66 (3):1382-1414.
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
A Remark on Weakly Compact Cardinals.Tapani Hyttinen - 2002 - Mathematical Logic Quarterly 48 (3):397-402.
A Note on Weakly O-Minimal Structures and Definable Completeness.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48 (2):281-292.

Analytics

Added to PP
2015-02-05

Downloads
12 (#1,081,406)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.

Add more citations

References found in this work

No references found.

Add more references