Results 81 to 90 of about 1,567 (182)
LOGIC, PRIMES AND COMPUTATION: A TALE OF UNREST
TASK Quarterly, 2005 The early connections between Mathematical Logic and Computer Science date back to the thirties and to the birth itself of modern Theoretical Computer Science, and concern computability.
STEFANO LEONESI, CARLO TOFFALORI
doaj
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, Volume 92, Issue 3, June 2026.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability [PDF]
Logical Methods in Computer Science, 2012 G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each other.
Matthias Baaz +2 more
doaj +1 more source
Acta Informatica, 1990 A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
openaire +2 more sources
Generalized modal satisfiability
Journal of Computer and System Sciences, 2010 32 pages, 3 figures.
Edith Hemaspaandra +2 more
openaire +3 more sources
Advanced Physics Research, Volume 5, Issue 5, May 2026.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
A Contextual Accuracy Dominance Argument for Probabilism
Philosophy and Phenomenological Research, Volume 112, Issue 3, Page 594-607, May 2026.ABSTRACT A central motivation for Probabilism—the principle of rationality that requires one to have credences that satisfy the axioms of probability—is the accuracy dominance argument: one should not have accuracy dominated credences, and one avoids accuracy dominance just in case one satisfies Probabilism.
Mikayla Kelley
wiley +1 more source
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Efficient Mechanisms for Multi‐Asset Bilateral Trading
Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.ABSTRACT We study when ex‐post efficient bilateral trade is possible under two‐sided asymmetric information with two agents and two assets, subject to balanced budget and voluntary participation constraints. We characterize how the interaction between asset characteristics and ownership structure determines the possibility of efficiency.
Nicolás Figueroa, Vasiliki Skreta
wiley +1 more source