Journal article

Learnability of quantified formulas

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Dalmau, V., & Jeavons, P. (2003). Learnability of quantified formulas. Theoretical Computer Science, 306, 485–511.

MLA Style

Dalmau, V, and P Jeavons. “Learnability of Quantified Formulas.” Theoretical Computer Science, no. 306, 2003, pp. 485–511.

Chicago Style

Dalmau, V, and P Jeavons. 2003. “Learnability of Quantified Formulas.” Theoretical Computer Science, no. 306: 485–511.
Print

Authors

+ Dalmau, V More by this author

Role:: Author

+ Jeavons, P More by this author

Role:: Author

Journal:: Theoretical Computer Science More from this journal
Issue:: 306
Pages:: 485-511
Publication date:: 2003-01-01

UUID:: uuid:47a81e6e-5c32-4cf3-83c6-65bf11c1e14e
Local pid:: cs:1673
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_47a81e6e5c324cf383c665bf11c1e14e

Terms of use

Copyright date:: 2003

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP