VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
absoluteness	Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
Abstract Elementary Classes	Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
atomic models	When excellence and local finiteness collide
axiom of global choice	Power Kripke-Platek set theory, ordinal analysis and global choice
B
Bachmann's H(1)	Systems of Strength H(1)
C
category theory	Functors in Computable Model Theory
circuit complexity	Set functions with small circuits
Cobham recursion	Set functions with small circuits Cobham Recursive Set Functions
Cobham recursive set functions	Proof Theoretic Characterisations of Feasible Set Functions
computability theory	Functors in Computable Model Theory
computable model theory	Functors in Computable Model Theory
counting functions	Analytic combinatorics of the transfinite
D
deep	Infinitely deep languages and neighbors
disjoint amalgamation	When excellence and local finiteness collide
E
effective reducibility	Classes of structures with no intermediate isomorphism problems
epsilon-recursion	Cobham Recursive Set Functions
excellence	When excellence and local finiteness collide
exponential integer part	Computing a floor function
F
feasible set functions	Proof Theoretic Characterisations of Feasible Set Functions
floor function	Computing a floor function
functor	Functors in Computable Model Theory
G
generalized predicativity	Systems of Strength H(1)
generating functions	Analytic combinatorics of the transfinite
I
Infinitary Logic	Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
infinitely	Infinitely deep languages and neighbors
integer part	Computing a floor function
integers	Computing a floor function
intermediate	Classes of structures with no intermediate isomorphism problems
K
Kripke Platek set theory	Proof Theoretic Characterisations of Feasible Set Functions
L
Languages	Infinitely deep languages and neighbors
limit laws	Analytic combinatorics of the transfinite
limited recursion	Cobham Recursive Set Functions
local finiteness	When excellence and local finiteness collide
O
ordinal analysis	Systems of Strength H(1) Power Kripke-Platek set theory, ordinal analysis and global choice
Ordinals	Analytic combinatorics of the transfinite
P
phase transitions	Analytic combinatorics of the transfinite
polynomial time	Set functions with small circuits Cobham Recursive Set Functions
Power Kripke-Platek set theory	Power Kripke-Platek set theory, ordinal analysis and global choice
R
real closed exponential field	Computing a floor function
real closed field	Computing a floor function
reals	Computing a floor function
recursion theory	Functors in Computable Model Theory
S
safe recursive set functions	Proof Theoretic Characterisations of Feasible Set Functions
set functions	Cobham Recursive Set Functions
T
Turing-computable embedding	Functors in Computable Model Theory
type theory	Systems of Strength H(1)
V
Vaught's conjecture	Classes of structures with no intermediate isomorphism problems

Disclaimer | Powered by EasyChair Smart Program