A simple proof of the polylog counting ability of first-order logic: guest column

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Arnaud Durand Équipe de Logique Mathématique UMR 7056, Paris, France
Clemens Lautemann Institut für Informatik, Johannes Gutenberg-Universität, Mainz, Germany
Malika More Univ. Clermont 1, IUT Info, Clermont-Ferrand, France
Published in:
Cover Image
 
· Newsletter
ACM SIGACT News archive
Volume 38 Issue 4, December 2007
Pages 40-45
ACM New York, NY, USA
table of contents doi>10.1145/1345189.1345199
A simple proof of the polylog counting ability of first-order logic: guest column Published by ACM 2007 Article
  • Column
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Downloads (cumulative): 79
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder