Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1864030191385313283 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Logical Methods in Computer Science |
| description | |
| discipline_display | Engineering & Technology |
| discipline_facet | Engineering & Technology |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:9862 |
| institution | FRELIP |
| journal_source_facet | Logical Methods in Computer Science |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories Computer Science & Information Science Computer Science & IT Engineering & Technology |
| sub_discipline_display | Computer Science & IT |
| sub_discipline_facet | Computer Science & IT |
| subject_display | Computer Science & Information Science Computer Science & IT Engineering & Technology Computer Science & Information Science Computer Science & IT Engineering & Technology |
| subject_facet | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| title | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_auth | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_full | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_fullStr | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_full_unstemmed | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_short | On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories |
| title_sort | on polynomial-time decidability of k-negations fragments of first-order theories |
| topic | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| url | https://doi.org/10.46298/lmcs-22(1:21)2026 |