Symbioses between mathematical logic and computer science

Whether or not there is a logic for P is the classic problem of descriptive complexity theory. It has been an open problem for over four decades (since its first formulation by Chandra and Harel [1980]) now and much has been written about it, including surveys and textbook presentations (see, for instance [Ebbinghaus and Flum 1999, Chapter 11]. The problem remains a focus of active research and there have been significant recent developments related to it. These may not be well known outside a specialist group of researchers and one aim of the present article is to bring these to a wider audience. To place the new results in their context, we begin with a wider perspective on the question.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Symbioses between mathematical logic and computer science

Cited by 2 publications

References 31 publications

Lamp control using the principles of mathematical logic

Lamp control using the principles of mathematical logic

A Logic for P: Are we Nearly There Yet?

Contact Info

Product

Resources

About