Logical depth - Wikipedia
Logical depth is a measure of complexity for individual strings devised by Charles H. Bennett based on the computational complexity of an algorithm that can
Relevant First-Order Logic $LP^\#$ and Curry's Paradox resolution
In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In thi...
Adding Data to Curry
Functional logic languages can solve equations over user-defined data and functions. Thus, the definition of an appropriate meaning of equality has a long history in these languages, ranging from reflexive equality in early equational logic languages...
On pp elimination and stability in a continuous setting
We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous logic theory...
Play Everywhere: A Temporal Logic based Game Environment Independent Approach for Playing…
Robots playing soccer often rely on hard-coded behaviors that struggle to generalize when the game environment change. In this paper, we propose a temporal logic based approach that allows robots' behaviors and goals to adapt to the semantics of the...
The interpretability logic of all reasonable arithmetical theories
This paper from 2000 is a presentation of a status quæstionis at that tiime, to wit of the problem of the interpretability logic of {\em all}\/ reasonable arithmetical theories. We present both the arithmetical side and the modal side of the questio...
A uniform cut-elimination theorem for linear logics with fixed points and super exponentia…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which may be red...
Jersey Matchup Solver
Hi guys I made a solver for this gamemode on base44, here it is, enjoy [https://jersey-logic-solve.base44.app](https://jersey-logic-solve.base44.app)...
Coalition and Group Announcement Logic
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition...
Quantifying over Boolean announcements
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct Box phi intuitively ex...
Coalition and Group Announcement Logic
Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other's knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition...
Asynchronous Announcements
We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the logic contain...
Which came first, set theory or logic?
The construction of first-order logic and set theory gives rise to apparent circularities of mutual dependence, making it unclear which can act as a self-contained starting point in the foundation of mathematics. In this paper, we carry out a metathe...
Logic Programming with Graph Automorphism: Integrating naut with Prolog (Tool Description)
This paper presents the plnauty~library, a Prolog interface to the nauty graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the "generate and prune" approach that is commonly used in logic programming and con...
Distributed Knowing How
Distributed knowledge is a key concept in the standard epistemic logic of knowledge-that. In this paper, we propose a corresponding notion of distributed knowledge-how and study its logic. Our framework generalizes two existing traditions in the logi...
Limits of Rush Hour Logic Complexity
Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space co...
Logical operator in a handlebars.js {{#if}} conditional
Tags: javascript, handlebars.js | Score: 567
Tweet Contest logic ( Twitter )
Tags: php, xml, twitter | Score: 1
rxjava2 branching logic based on number of emissions
Tags: java, rx-java2, project-reactor | Score: 0
Modal completeness of sublogics of the interpretability logic $\mathbf{IL}$
We study modal completeness and incompleteness of several sublogics of the interpretability logic $\mathbf{IL}$. We introduce the sublogic $\mathbf{IL}^-$, and prove that $\mathbf{IL}^-$ is sound and complete with respect to Veltman prestructures whi...