Journal of Symbolic Logic

The Journal of Symbolic Logic is a peer-reviewed mathematics journal published quarterly by Association for Symbolic Logic. It was established in 1936 and covers mathematical logic. The journal is indexed by Mathematical Reviews, Zentralblatt MATH, and Scopus. Its 2009 MCQ was 0.28, and its 2009 impact factor was 0.631. Source: Wikipedia (en)

Editions published in Journal of Symbolic Logic 200

Too many entities requested (597). Only 200 are displayed.

MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER
UNIMODULARITY UNIFIED
CELL DECOMPOSITION AND CLASSIFICATION OF DEFINABLE SETS IN p-OPTIMAL FIELDS
EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE
REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS
INDEFINITENESS IN SEMI-INTUITIONISTIC SET THEORIES: ON A CONJECTURE OF FEFERMAN
COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF ${\rm{\Sigma }}_2^0$ INDUCTION
A PSEUDOEXPONENTIAL-LIKE STRUCTURE ON THE ALGEBRAIC NUMBERS
MATHIAS FORCING AND COMBINATORIAL COVERING PROPERTIES OF FILTERS
COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY
Models of transfinite provability logic
On Colimits and Elementary Embeddings
Unexpected imaginaries in valued fields with analytic structure
Pointwise definable models of set theory
Herbrand consistency of some arithmetical theories
Dynamic topological logic of metric spaces
The Friedman-Sheard programme in intuitionistic logic
Independently axiomatizable ℒω1,ω theories
Large cardinals and definable well-orders on the universe
Lawvere–Tierney sheaves in Algebraic Set Theory
From index sets to randomness in ∅n: random reals and possibly infinite computations part II
Examples of non-locality
Measurable chromatic numbers
Complex tilings
Strongly unfoldable cardinals made indestructible
The logic of interactive turing reduction
Connecting many-sorted theories
Asymptotic classes of finite structures
A power function with a fixed finite gap everywhere
Computable trees of Scott rank ω 1 CK , and computable approximation
The generalised type-theoretic interpretation of constructive set theory
Randomness and halting probabilities

Subject - wd:Q6295979

Welcome to Inventaire

the library of your friends and communities

learn more

Subject

Journal of Symbolic Logic

Editions published in Journal of Symbolic Logic 200

MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER

UNIMODULARITY UNIFIED

CELL DECOMPOSITION AND CLASSIFICATION OF DEFINABLE SETS IN p-OPTIMAL FIELDS

EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE

REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS

INDEFINITENESS IN SEMI-INTUITIONISTIC SET THEORIES: ON A CONJECTURE OF FEFERMAN

COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF ${\rm{\Sigma }}_2^0$ INDUCTION

A PSEUDOEXPONENTIAL-LIKE STRUCTURE ON THE ALGEBRAIC NUMBERS

MATHIAS FORCING AND COMBINATORIAL COVERING PROPERTIES OF FILTERS

COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY

Models of transfinite provability logic

On Colimits and Elementary Embeddings

Unexpected imaginaries in valued fields with analytic structure

Pointwise definable models of set theory

Herbrand consistency of some arithmetical theories

Dynamic topological logic of metric spaces

The Friedman-Sheard programme in intuitionistic logic

Independently axiomatizable ℒω1,ω theories

Large cardinals and definable well-orders on the universe

Lawvere–Tierney sheaves in Algebraic Set Theory

From index sets to randomness in ∅n: random reals and possibly infinite computations part II

Examples of non-locality

Measurable chromatic numbers

Complex tilings

Strongly unfoldable cardinals made indestructible

The logic of interactive turing reduction

Connecting many-sorted theories

Asymptotic classes of finite structures

A power function with a fixed finite gap everywhere

Computable trees of Scott rank ω 1 CK , and computable approximation

The generalised type-theoretic interpretation of constructive set theory

Randomness and halting probabilities

Welcome to Inventaire