Cover Image

Deducibility in Sudoku

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mašulović, Dragan
Format:	Preprint
Published:	2022
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Big Ramsey combinatorics of the Cantor set and a simple proof of Blass' perfect set theorem
by: Mašulović, Dragan
Published: (2026)

On Ramsey degrees, compactness and approximability
by: Mašulović, Dragan
Published: (2024)

Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition
by: Mašulović, Dragan, et al.
Published: (2024)

Deducibility of Identicals, Reflection Principle and Synthetic Connectives
by: Nishimuta, Yuki
Published: (2019)

A Study Of Sudoku Solving Algorithms: Backtracking and Heuristic
by: Bhattarai, Apekshya, et al.
Published: (2025)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Omission of Intervals: Deducing covering properties of subsets of the real line from their combinatorial structure
by: Tsaban, Boaz
Published: (2024)

Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, et al.
Published: (2025)

Coalgebraic methods for Ramsey degrees of unary algebras
by: Mašulović, Dragan
Published: (2021)

Corrigendum and Addendum to "Fra\"ıssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition''
by: Mašulović, Dragan
Published: (2026)

Coalgebras for categorical deep learning: Representability and universal approximation
by: Mašulović, Dragan
Published: (2026)

Ramsey degrees: big v. small
by: Mašulović, Dragan
Published: (2020)

A New Proof of the Nešetřil-Rödl Theorem
by: Masulovic, Dragan
Published: (2017)

On $k$-ary parts of maximal clones
by: Mašulović, Dragan, et al.
Published: (2023)

Classes of finite relational structures over finite languages have dual Ramsey degrees
by: Džuklevski, Aleksa, et al.
Published: (2024)

Temporal Causal Reasoning with (Non-Recursive) Structural Equation Models
by: Gladyshev, Maksim, et al.
Published: (2025)

Countability constraints in order-theoretic approaches to computability
by: Hack, Pedro, et al.
Published: (2022)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
by: Kihara, Takayuki
Published: (2022)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
by: Lichter, Moritz
Published: (2022)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
by: Oda, Yukihiro, et al.
Published: (2022)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

Incompleteness for stably computable formal systems
by: Savelyev, Yasha
Published: (2022)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
by: Livson, Ori, et al.
Published: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
by: Oda, Yukihiro
Published: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Demystifying $μ$
by: Afshari, Bahareh, et al.
Published: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Proof-theoretic Semantics for Second-order Logic
by: Gheorghiu, Alexander V., et al.
Published: (2025)

List types for resource aware languages: an implicit name approach
by: Ghilezan, Silvia, et al.
Published: (2021)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
by: Hansen, Helle Hvid, et al.
Published: (2025)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Constructive higher sheaf models with applications to synthetic mathematics
by: Coquand, Thierry, et al.
Published: (2026)

Bijective proofs for Eulerian numbers of types B and D
by: Santocanale, Luigi
Published: (2021)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
by: Herbelin, Hugo
Published: (2024)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
by: Powell, Thomas
Published: (2023)

The strength of the dominance rule
by: Kołodziejczyk, Leszek Aleksander, et al.
Published: (2024)