Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers

From MaRDI portal
Publication:1896999
Jump to:navigation, search

DOI10.1007/3-540-60178-3zbMath0847.00025OpenAlexW2487994344MaRDI QIDQ1896999

No author found.

Publication date: 13 September 1995

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3

zbMATH Keywords

ProceedingsWorkshopLogicComputational complexityLCCIndianapolis, IN (USA)


Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)


Related Items

1998 European Summer Meeting of the Association for Symbolic Logic, A new “feasible” arithmetic, A simple proof of Parsons' theorem



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1896999&oldid=14304995"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki