Logic & foundations
515 studies29 in 7 days207 in 30 days
Filters
Latest
515 studies
- Intuitionistic Implication in Elementary Team Logics
- Higher-Order Quadripolar Argumentation Framework and Encoded Semantics
- The Borel Distinguishing Number of Schreier Graphs
- Every introenumerable set contains a uniformly introreducible subset
- Lascar Rank in Expansions
- A complete representation theorem for nullnorms on bounded trellises
- Deciding Amalgamation Beyond Arity Two: The Semantic Horn Case
- Non-Terminal Complexity of Simple Semi-Conditional Grammars
- Restrictions of Infinite Circuits
- Diamonds in mice
- On Banach and Kuratowski Theorem and generalized strong sequences
- The universal measure of probabilistically nonrandom objects
- Medvedev logic is undecidable
- Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions
- Small masas of the Calkin algebra in the Cohen model
- Finite-tower bounds for Skolem functions
- Fraïssé's conjecture, partial impredicativity and well-ordering principles, part II
- Effective recurrence for computable measure-preserving transformations
- A Catalogue of Properties of Binary Relations: Entailments, Incompatibilities, and Independence Results
- An automorphism tower of length κ+
- The Borel complexity of conjugacy for Cantor minimal systems
- Unfriendly partitions of locally finite Borel graphs
- Every subset of a topological Ramsey space is Ramsey in the Solovay model
- Medvedev Logic is Not Decidable. It is π01 -complete. Who Would Have Guessed?
- Possibilistic Logic over a Logic of Formal Inconsistency