Suchergebnisse - "non-elementary complexity"

Simply typed convertibility is TOWER-complete even for safe lambda-terms

Autoren: Nguyễn, Lê Thành Dũng

Weitere Verfasser: Nguyễn, Lê Thành Dũng

Quelle: Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)

Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, BC1-199, Computer Science - Programming Languages, Logic, computer science - programming languages, QA75.5-76.95, [INFO] Computer Science [cs], non-elementary complexity, Logic in Computer Science (cs.LO), computer science - logic in computer science, safe λ-calculus, Electronic computers. Computer science, Programming Languages (cs.PL)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2305.12601
https://lmcs.episciences.org/11344
https://doi.org/10.46298/lmcs-20(3:21)2024
https://doaj.org/article/5a51bc2116854e2487bc2c8c84486275
https://hal.science/hal-04688374v1/document
https://hal.science/hal-04688374v1
https://doi.org/10.46298/lmcs-20(3:21)2024

Higher-Order Quantified Boolean Satisfiability

Autoren: Chistikov, Dmitry Haase, Christoph Hadizadeh, Zahra et al.

Weitere Verfasser: Chistikov, Dmitry Haase, Christoph Hadizadeh, Zahra et al.

Schlagwörter: Boolean satisfiability problem, higher-order Boolean functions, weak k-EXP hierarchies, non-elementary complexity, Presburger arithmetic

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.MFCS.2022.33
https://nbn-resolving.org/urn:nbn:de:0030-drops-168313
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33

Cut normal forms and proof complexity

Autoren: Matthias Baaz Alexander Leitsch

Quelle: Annals of Pure and Applied Logic. 97:127-177

Schlagwörter: Complexity of proofs, cut normal forms, equational sequents, Logic, cut-elimination, non-monotone cuts, Cut-elimination and normal-form theorems, 0102 computer and information sciences, 0101 mathematics, non-elementary complexity, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1340820
https://doi.org/10.1016/s0168-0072(98)00026-8
https://www.sciencedirect.com/science/article/pii/S0168007298000268
https://dblp.uni-trier.de/db/journals/apal/apal97.html#BaazL99
https://philpapers.org/rec/BAACNF

Higher-Order Quantified Boolean Satisfiability

Autoren: Dmitry Chistikov and Christoph Haase and Zahra Hadizadeh and Alessio Mansutti Chistikov, Dmitry Haase, Christoph et al.

Index Begriffe: Boolean satisfiability problem, higher-order Boolean functions, weak k-EXP hierarchies, non-elementary complexity, Presburger arithmetic, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33
Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)