The following pages link to Annals of Pure and Applied Logic (Q122505):
Displaying 34 items.
- Reverse mathematics and initial intervals (Q386152) (← links)
- Relativized ordinal analysis: the case of power Kripke-Platek set theory (Q392292) (← links)
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- Dichotomy theorems for countably infinite dimensional analytic hypergraphs (Q639663) (← links)
- A generalized notion of weak interpretability and the corresponding modal logic (Q685075) (← links)
- Pseudo-exponentiation on algebraically closed fields of characteristic zero (Q703838) (← links)
- Tangled modal logic for topological dynamics (Q764267) (← links)
- Reducts of the generic digraph (Q904153) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed (Q1096622) (← links)
- A new system of proof-theoretic ordinal functions (Q1109029) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- A game semantics for linear logic (Q1192350) (← links)
- Categoricity for abstract classes with amalgamation (Q1302296) (← links)
- Finite covers with finite kernels (Q1377640) (← links)
- Intuitionistic axiomatizations for bounded extension Kripke models. (Q1412839) (← links)
- Inaccessible set axioms may have little consistency strength (Q1612481) (← links)
- The Nikodym property and cardinal characteristics of the continuum (Q1616770) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- Multicomponent proof-theoretic method for proving interpolation properties (Q1799040) (← links)
- Subtle cardinals and linear orderings (Q1840455) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \(\Pi_ 2^ 1\) Wadge degrees (Q1919526) (← links)
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems (Q1919534) (← links)
- On variants of \(o\)-minimality (Q1919545) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- On partial randomness (Q2576938) (← links)
- Ehrenfeucht-Fraïssé games on ordinals (Q2636521) (← links)
- First order theory of cyclically ordered groups (Q2636535) (← links)
- Foreword (Q5891368) (← links)
- Bounded forcing axioms and the continuum (Q5939844) (← links)
