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

Krom formulas with one dyadic predicate letter

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

DOI10.2307/2272233zbMath0381.03012OpenAlexW4248984264MaRDI QIDQ4159027

Harry R. Lewis

Publication date: 1976

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272233


Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)


Related Items

Satisfiability of the smallest binary program, On the complexity of single-rule datalog queries.



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