We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs an...
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem....
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of the logic ar...
One leading question with respect to Bi-intuitionistic logic (BINT) is, what does BINT look like across the three arcs -- logic, typed $λ$-calculi, and category theory -- of the Curry-Howard-Lambek correspondence? Categorically, BINT can be seen as...
This paper investigates neighborhood and algebraic models for predicate modal logics with $ω$-rules, including non-normal cases. We establish sufficient conditions under which such logics have neighborhood models with constant domains and satisfy th...
One limit to the fidelity of quantum logic operations on trapped ions arises from heating of the ions' collective modes of motion. Sympathetic cooling of the ions during the logic operations may eliminate this source of errors. We discuss benefits...
We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfounded...
Reversible logic has promising applications in emerging nanotechnologies, such as quantum computing, quantum dot cellular automata and optical computing, etc. Faults in reversible logic circuits that result in multi-bit error at the outputs are very...
Papers on neutrosophy (a generalization of dialectics), on neutrosophic logic, set, probability and statistics (generalizations of fuzzy logic, fuzzy set, and imprecise probability respectively), by Florentin Smarandache, Jean Dezert, S. Bhattachar...
The speed of modern digital systems is severely limited by memory latency (the ``Memory Wall'' problem). Data exchange between Logic and Memory is also responsible for a large part of the system energy consumption. Logic--In--Memory (LiM) represents...
Dec 1, 2023 · Help Needed on This Logic Puzzle 12-01-2023, 09:46 PM Good day all, I am just starting out solving logic puzzles and I am trying to solve a puzzle in a weekly magazine. Usually I can solve …
We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic L4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy. The embedding allows to represent every term...
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth defin...
Ron (June 27, 2017). "Sumo Logic lands $75 million Series F, on path to IPO". TechCrunch. Mark Cox (23 July 2018), Sumo Logic lights up Google Cloud Platform
We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem....
Ce logiciel est un logiciel de reconnaissance faciale permettant de détecter le visage d'une personne dans une vidéo (nous avons utilisé notre webCam). A partir de la base de données de visages embarquées, ce logiciel nous donnera le nom de la personne dont le visage est détecté.…
encompasses the school of dialetheism. In classical logic (as well as intuitionistic logic and most other logics), contradictions entail everything. This
In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given world, but we s...