From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract)
From MaRDI portal
Publication:6199576
DOI10.1007/978-3-031-39784-4_3arXiv2303.14338OpenAlexW4386208132MaRDI QIDQ6199576
Dusko Pavlovic, Temra Pavlovic
Publication date: 28 February 2024
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.14338
Cites Work
- The geometry of tensor calculus. I
- Model theory
- Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract)
- Logics for actor networks: a two-stage constrained-hybridisation approach
- Logics for epistemic programs
- Logical Dynamics of Information and Interaction
- Formal Derivation of Concurrent Garbage Collectors
- Verification: Theory and Practice
- Epistemic Actions as Resources
- Evolving Specification Engineering
- An axiomatic basis for computer programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract)
