← 研踪 PaperTrailarXiv:2611.01625 · v1
Classification of non-Leibnizian Strings
首次提交 2026-11-01 14:18
版本更新 2026-11-01 14:18
雷达观测 2026-11-04 23:43
摘要
Leibnizian ideas in foundations of physics has enjoyed a renewed interest. Cyclic string ontology in Wolfram Model multiway rewriting systems has been found to encode finite dimensional quantum systems where what are called as Leibnizian strings have been employed. It has then become important to classify strings in terms of their ability to correspond to a monadic interpretation à la Leibniz. The definition of Leibnizian strings are rather quite non-linear and for that purpose we classify non-Leibnizian strings for which there is a simpler criterion on maximal neighborhoods of characters. If a string is not non-Leibnizian then it must be Leibnizian. We found out three canonical forms of non-Leibnizian strings and noted that two of them are context-free languages whereas one is not.
作者备注：12 pages, 1 figure. Accepted for publication in Complex Systems
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-01 14:18 · 最新观测版本
Classification of non-Leibnizian Strings
Leibnizian ideas in foundations of physics has enjoyed a renewed interest. Cyclic string ontology in Wolfram Model multiway rewriting systems has been found to encode finite dimensional quantum systems where what are called as Leibnizian strings have been employed. It has then become important to classify strings in terms of their ability to correspond to a monadic interpretation à la Leibniz. The definition of Leibnizian strings are rather quite non-linear and for that purpose we classify non-Leibnizian strings for which there is a simpler criterion on maximal neighborhoods of characters. If a string is not non-Leibnizian then it must be Leibnizian. We found out three canonical forms of non-Leibnizian strings and noted that two of them are context-free languages whereas one is not.
查看此版本解读 →查看此版本原文 ↗