The following pages link to Jörg Flum (Q490658):
Displayed 50 items.
- Consistency, optimality, and incompleteness (Q490660) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Item:Q490658 (redirect page) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Item:Q490658 (redirect page) (← links)
- Modelltheorie - topologische Modelltheorie (Q793013) (← links)
- Model complete universal Horn classes (Q800351) (← links)
- On miniaturized problems in parameterized complexity theory (Q820145) (← links)
- Existentially closed structures and E-companions (Q912840) (← links)
- Omega-categoricity, relative categoricity and coordinatisation (Q912842) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- Strongly minimal countably categorical theories. II (Q1068080) (← links)
- On the definability of the quantifier ''there exist uncountably many'' (Q1073785) (← links)
- Martin's conjecture for \(\omega\)-stable theories (Q1077407) (← links)
- Strongly minimal countably categorical theories. III (Q1080414) (← links)
- Decision procedure for a class of \((L_{\omega _ 1\omega})_ t\)-types of \(T_ 3\) spaces (Q1102274) (← links)
- Cantor-Bendixson spectra of \(\omega\)-stable theories (Q1106837) (← links)
- Structures coordinatized by indiscernible sets (Q1109025) (← links)
- Topological model theory (Q1132868) (← links)
- The cardinality of powersets in finite models of the powerset axiom (Q1183720) (← links)
- On a combinatorial problem from the model theory of wreath products. II (Q1291123) (← links)
- Quantifiers and congruence closure (Q1300006) (← links)
- Extended order-generic queries (Q1302301) (← links)
- A counterexample to the 0-1 law for the class of existential second-order minimal Gödel sentences with equality (Q1317435) (← links)
- Zero-one laws for modal logic (Q1337692) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Guarded quantification in least fixed point logic (Q1424969) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- Vectorization hierarchies of some graph quantifiers (Q1568709) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Games, kernels, and antitone operations (Q1583847) (← links)
- MSO zero-one laws on random labelled acyclic graphs (Q1613549) (← links)
- There is no recursive link between the \(k\)-size of a model and its cardinality (Q1861532) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- On a combinatorial problem from the model theory of wreath products. III (Q1971617) (← links)
- On stability in finite models (Q1976880) (← links)
- On Horn theories (Q2265427) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Parametrized complexity theory. (Q2488567) (← links)
- Arity hierarchies (Q2563982) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- On \(\nu ^ +\)-saturated ordered fields and Boolean algebras (Q2640593) (← links)
- Fixed-Parameter Tractability, Definability, and Model-Checking (Q2719133) (← links)
- (Q2729237) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)