The following pages link to Annals of Pure and Applied Logic (Q122505):
Displaying 50 items.
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) (Q385070) (← links)
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073) (← links)
- On \(\omega\)-categorical, generically stable groups and rings (Q385075) (← links)
- Operational closure and stability (Q385076) (← links)
- Degrees of orders on torsion-free abelian groups (Q385079) (← links)
- Super/rosy \(L^k\)-theories and classes of finite structures (Q385799) (← links)
- Martin-Löf complexes (Q385803) (← links)
- Combinatorial realizability models of type theory (Q385804) (← links)
- Elementary geometric local-global principles for fields (Q385805) (← links)
- A proof-theoretic account of classical principles of truth (Q385807) (← links)
- Natural factors of the Muchnik lattice capturing IPC (Q385809) (← links)
- Approximation of o-minimal maps satisfying a Lipschitz condition (Q386146) (← links)
- The degrees of bi-hyperhyperimmune sets (Q386147) (← links)
- Observing, reporting, and deciding in networks of sentences (Q386149) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Reverse mathematics and initial intervals (Q386152) (← links)
- Mathias-Prikry and Laver-Prikry type forcing (Q386153) (← links)
- Posets of copies of countable scattered linear orders (Q386154) (← links)
- Omitting types for infinitary \([0,1]\)-valued logic (Q386155) (← links)
- Cohesive sets and rainbows (Q386619) (← links)
- Relational dual tableau decision procedures and their applications to modal and intuitionistic logics (Q386620) (← links)
- Relating first-order set theories, toposes and categories of classes (Q386623) (← links)
- Consistent amalgamation for þ-forking (Q386624) (← links)
- Nonstandard second-order arithmetic and Riemann's mapping theorem (Q386626) (← links)
- On compactifications and the topological dynamics of definable groups (Q386629) (← links)
- Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience (Q386630) (← links)
- Many countable support iterations of proper forcings preserve Souslin trees (Q386631) (← links)
- Separating weak partial square principles (Q386633) (← links)
- On supercompactness and the continuum function (Q386634) (← links)
- Bounding, splitting, and almost disjointness (Q386637) (← links)
- On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
- Squares and covering matrices (Q386640) (← links)
- Theories without the tree property of the second kind (Q386642) (← links)
- 2-minimality, jump classes and a note on natural definability (Q386644) (← links)
- Propagation of partial randomness (Q386647) (← links)
- Non-commutative logical algebras and algebraic quantales (Q386648) (← links)
- Automatic models of first order theories (Q387121) (← links)
- Applications of pcf for mild large cardinals to elementary embeddings (Q387122) (← links)
- Basic subtoposes of the effective topos (Q387125) (← links)
- Bare canonicity of representable cylindric and polyadic algebras (Q387126) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus (Q388206) (← links)
- Axiomatizing first-order consequences in dependence logic (Q388209) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- The life and work of Sergei Artemov (Q392268) (← links)
- Logical omniscience as infeasibility (Q392271) (← links)
- What is relevance logic? (Q392272) (← links)
- The logic of justified belief, explicit knowledge, and conclusive evidence (Q392273) (← links)
- Positive provability logic for uniform reflection principles (Q392274) (← links)
