Conference item

The Limits of Decidability for First Order Logic on CPDA Graphs

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

Broadbent, C. (2012). The Limits of Decidability for First Order Logic on CPDA Graphs.

MLA Style

Broadbent, C. “The Limits of Decidability for First Order Logic on CPDA Graphs.” 2012.

Chicago Style

Broadbent, C. 2012. “The Limits of Decidability for First Order Logic on CPDA Graphs.”
Print

Access Document

Files:: CPDAFOUndec.pdf

(Preview, pdf, 743.3KB, Terms of use)

Authors

+ Broadbent, C More by this author

Role:: Author

Host title:: Submitted to STACS
Publication date:: 2012-01-01

UUID:: uuid:48cd157c-c380-4694-ba5f-8ca28ee3bb33
Local pid:: cs:5413
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_48cd157cc3804694ba5f8ca28ee3bb33

Terms of use

Copyright date:: 2012

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