Matches in SemOpenAlex for { <https://semopenalex.org/work/W2125362004> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W2125362004 endingPage "63" @default.
- W2125362004 startingPage "47" @default.
- W2125362004 abstract "Mathematical Logic QuarterlyVolume 33, Issue 1 p. 47-63 Article Second-order and Inductive Definability on Finite Structures Michel De Rougemont, Michel De Rougemont European Computer-Industry Research Centre Arabellastr. 17 D-8000 München 81Search for more papers by this author Michel De Rougemont, Michel De Rougemont European Computer-Industry Research Centre Arabellastr. 17 D-8000 München 81Search for more papers by this author First published: 1987 https://doi.org/10.1002/malq.19870330107Citations: 53AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat References 1 Barwise, J., On Moschovakis closure ordinals. J. Symbolic Logic 42 (1977), 292–296. 2 Barwise, J., and Y. Moschovakis, Global inductive definability. J. Symbolic Logic 43 (1978), 521–534. 3 Chandra, A., and D. Harel, Structure and complexity of relational queries. J. Comput. System Sci. 25 (1982), 99–128. 4 Fagin, R., Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computations. SIAM-AMS Proc. 7 (1974), pp. 43–73. 5 Fagin, R., Monadic generalized spectra. This Zeitschrift 21 (1975), 89–96. 6 Fraïssé, R., Cours de Logique Mathematique. Gauthier-Villars, Paris 1972. 7 Immerman, N., Relational queries computable in polynomial time. In: Annual ACM Symposium on Theory of Computing 1982, pp. 147–162. 8 Immerman, N., Upper and lower bounds for first-order expressibility. J. Comput. System Sci. 25 (1982), 76–98. 9 Moschovakis, Y., Elementary Induction on Abstract Structures. North-Holland Publ. Comp., Amsterdam 1974. 10 Sazonov, V., Polynomial computability and recursivity in finite domains. Elektron. Informationsverarb. Kybernet. 16 (1980), 319–323. 11 Vardi, M., Complexity of relational query languages. In: Annual ACM Symposium on Theory of Computing 1982, pp. 137–146. Citing Literature Volume33, Issue11987Pages 47-63 ReferencesRelatedInformation" @default.
- W2125362004 created "2016-06-24" @default.
- W2125362004 creator A5029937539 @default.
- W2125362004 date "1987-01-01" @default.
- W2125362004 modified "2023-09-27" @default.
- W2125362004 title "Second-order and Inductive Definability on Finite Structures" @default.
- W2125362004 cites W1965372036 @default.
- W2125362004 cites W1984581643 @default.
- W2125362004 cites W1984890936 @default.
- W2125362004 cites W2132541147 @default.
- W2125362004 doi "https://doi.org/10.1002/malq.19870330107" @default.
- W2125362004 hasPublicationYear "1987" @default.
- W2125362004 type Work @default.
- W2125362004 sameAs 2125362004 @default.
- W2125362004 citedByCount "62" @default.
- W2125362004 countsByYear W21253620042012 @default.
- W2125362004 countsByYear W21253620042014 @default.
- W2125362004 crossrefType "journal-article" @default.
- W2125362004 hasAuthorship W2125362004A5029937539 @default.
- W2125362004 hasConcept C10138342 @default.
- W2125362004 hasConcept C110812573 @default.
- W2125362004 hasConcept C114614502 @default.
- W2125362004 hasConcept C118615104 @default.
- W2125362004 hasConcept C134306372 @default.
- W2125362004 hasConcept C136119220 @default.
- W2125362004 hasConcept C146834321 @default.
- W2125362004 hasConcept C162324750 @default.
- W2125362004 hasConcept C17744445 @default.
- W2125362004 hasConcept C182306322 @default.
- W2125362004 hasConcept C199539241 @default.
- W2125362004 hasConcept C202444582 @default.
- W2125362004 hasConcept C33923547 @default.
- W2125362004 hasConcept C41008148 @default.
- W2125362004 hasConceptScore W2125362004C10138342 @default.
- W2125362004 hasConceptScore W2125362004C110812573 @default.
- W2125362004 hasConceptScore W2125362004C114614502 @default.
- W2125362004 hasConceptScore W2125362004C118615104 @default.
- W2125362004 hasConceptScore W2125362004C134306372 @default.
- W2125362004 hasConceptScore W2125362004C136119220 @default.
- W2125362004 hasConceptScore W2125362004C146834321 @default.
- W2125362004 hasConceptScore W2125362004C162324750 @default.
- W2125362004 hasConceptScore W2125362004C17744445 @default.
- W2125362004 hasConceptScore W2125362004C182306322 @default.
- W2125362004 hasConceptScore W2125362004C199539241 @default.
- W2125362004 hasConceptScore W2125362004C202444582 @default.
- W2125362004 hasConceptScore W2125362004C33923547 @default.
- W2125362004 hasConceptScore W2125362004C41008148 @default.
- W2125362004 hasIssue "1" @default.
- W2125362004 hasLocation W21253620041 @default.
- W2125362004 hasOpenAccess W2125362004 @default.
- W2125362004 hasPrimaryLocation W21253620041 @default.
- W2125362004 hasRelatedWork W171076485 @default.
- W2125362004 hasRelatedWork W1975647703 @default.
- W2125362004 hasRelatedWork W1978042415 @default.
- W2125362004 hasRelatedWork W2044273750 @default.
- W2125362004 hasRelatedWork W2054384926 @default.
- W2125362004 hasRelatedWork W2062781507 @default.
- W2125362004 hasRelatedWork W2118359714 @default.
- W2125362004 hasRelatedWork W2513070253 @default.
- W2125362004 hasRelatedWork W2562957045 @default.
- W2125362004 hasRelatedWork W3113077340 @default.
- W2125362004 hasVolume "33" @default.
- W2125362004 isParatext "false" @default.
- W2125362004 isRetracted "false" @default.
- W2125362004 magId "2125362004" @default.
- W2125362004 workType "article" @default.