{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:56:24Z","timestamp":1773244584261,"version":"3.50.1"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n        <jats:p>A logic is a mathematical model of knowledge used to study how we reason, how we describe\nthe world, and how we infer the conclusions that determine our behavior. The logic presented\nhere is natural. It has been experimentally observed, not designed. It represents knowledge as a\ncausal set, includes a new type of inference based on the minimization of an action functional,\nand generates its own semantics, making it unnecessary to prescribe one. This logic is suitable\nfor high-level reasoning with computer code, including tasks such as self-programming, objectoriented\nanalysis, refactoring, systems integration, code reuse, and automated programming from\nsensor-acquired data.<\/jats:p><jats:p>\nA strong theoretical foundation exists for the new logic. The inference derives laws of\nconservation from the permutation symmetry of the causal set, and calculates the corresponding\nconserved quantities. The association between symmetries and conservation laws is a fundamental\nand well-known law of nature and a general principle in modern theoretical Physics. The conserved\nquantities take the form of a nested hierarchy of invariant partitions of the given set. The logic\nassociates elements of the set and binds them together to form the levels of the hierarchy. It is\nconjectured that the hierarchy corresponds to the invariant representations that the brain is known\nto generate. The hierarchies also represent fully object-oriented, self-generated code, that can be\ndirectly compiled and executed (when a compiler becomes available), or translated to a suitable\nprogramming language.<\/jats:p><jats:p>\nThe approach is constructivist because all entities are constructed bottom-up, with the\nfundamental principles of nature being at the bottom, and their existence is proved by construction.<\/jats:p><jats:p>\nThe new logic is mathematically introduced and later discussed in the context of transformations\nof algorithms and computer programs. We discuss what a full self-programming\ncapability would really mean. We argue that self-programming and the fundamental question\nabout the origin of algorithms are inextricably linked. We discuss previously published, fully\nautomated applications to self-programming, and present a virtual machine that supports the logic,\nan algorithm that allows for the virtual machine to be simulated on a digital computer, and a fully\nexplained neural network implementation of the algorithm.<\/jats:p>","DOI":"10.2478\/v10229-011-0020-6","type":"journal-article","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T12:56:09Z","timestamp":1360846569000},"page":"11-42","source":"Crossref","is-referenced-by-count":3,"title":["Reasoning with Computer Code: a new Mathematical Logic"],"prefix":"10.2478","volume":"3","author":[{"given":"Sergio","family":"Pissanetzky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","container-title":["Journal of Artificial General Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/jagi\/3\/3\/article-p11.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/jagi.2012.3.issue-3\/v10229-011-0020-6\/v10229-011-0020-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T16:04:10Z","timestamp":1590854650000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/v10229-011-0020-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,4]]},"references-count":0,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.2478\/v10229-011-0020-6","relation":{},"ISSN":["1946-0163"],"issn-type":[{"value":"1946-0163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,4]]}}}