Days: Monday, July 14th Tuesday, July 15th Wednesday, July 16th Thursday, July 17th Friday, July 18th Saturday, July 19th
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:45 | Welcome Address by the Rector (abstract) |
08:50 | Welcome Address by the Organizers (abstract) |
08:55 | VSL Opening (abstract) |
09:15 | VSL Keynote Talk: Computational Ideas and the Theory of Evolution (abstract) |
11:00 | Tutorial on Stategic and Extensive Games 1 (abstract) |
12:00 | Applications of admissible computability (abstract) |
14:30 | The DNA of logic and games. (abstract) |
15:15 | Dependence and independence - a logical approach (abstract) |
14:30 | Pregeometries and definable groups (abstract) |
15:15 | Quasiminimal structures and excellence (abstract) |
14:30 | Uniform and non-uniform reducibilities of algebraic structures (abstract) |
15:15 | Randomness in the Weihrauch degrees (abstract) |
14:30 | Inductive Proofs & the Knowledge They Represent (abstract) |
15:15 | Decidable languages for knowledge representation and inductive definitions: From Datalog to Datalog+/- (abstract) |
16:30 | Natural deduction for intuitionistic differential linear logic (abstract) |
16:50 | An outline of intuitionistic epistemic logic (abstract) |
17:10 | Some properties related to the existence property in intermediate predicate logics (abstract) |
17:30 | On Hallden complete modal logics determined by homogeneous frames (abstract) |
17:50 | A universal diagonal schema by fixed-points and Yablo’s paradox (abstract) |
18:10 | Canonical extensions and prime filter completions of poset expansions. (abstract) |
16:30 | On the compactness theorem in many valued logics (abstract) |
16:50 | Formalizing vagueness as a doxastic, relational concept (abstract) |
17:10 | Two Formalisms for a Logic of Generalized Truth Values (abstract) |
17:30 | Characterising Logics through their Admissible Rules (abstract) |
17:50 | Models for the probabilistic sequent calculus (abstract) |
18:10 | Display-type calculi for non classical logics (abstract) |
16:30 | Complexity bounds for Multiagent Justification Logic (abstract) |
16:50 | The relation between the graphs structures and proof complexity of corresponding Tseitin graph tautologies (abstract) |
17:10 | The algorithmic complexity of decomposability in fragments of first-order logic (abstract) |
17:30 | Type equations and second order logic (abstract) |
17:50 | An intuitive semantics for {Full Intuitionistic Linear Logic} (abstract) |
18:10 | Argumentation Logic (abstract) |
16:30 | On the existential interpretability of structures (abstract) |
16:50 | The isomorphism problem for computable projective planes (abstract) |
17:10 | Coding graphs into fields (abstract) |
17:30 | Uniformization in the hereditarily finite list superstructure over the real exponential field (abstract) |
17:50 | Dynamic logic on approximation spaces (abstract) |
18:10 | On limitwise monotonic reducibility of Σ^0_2-sets. (abstract) |
16:30 | Relativized universal numberings (abstract) |
16:50 | Ideals without minimal numberings in the Rogers semilattice (abstract) |
17:10 | Computable numberings in Analytical Hierarchy (abstract) |
17:30 | Definability of 0' in the structure of $\omega$-enumeration degrees (abstract) |
17:50 | Embedding the omega-enumeration degrees into the Muchnik degrees generated by spectra of structures (abstract) |
18:10 | Limitwise monotonic sets of reals (abstract) |
16:30 | An Intuitionistic Interpretation of Classical Implication (abstract) |
16:50 | Predicate Glivenko theorems and substructural aspects of negative translations (abstract) |
17:10 | Adding a Conditional to Kripke's Theory of Truth (abstract) |
17:30 | Constructive completeness and Joyal's theorem (abstract) |
17:50 | Algorithmic-algebraic canonicity for mu-calculi (abstract) |
18:10 | Proof-Theoretic Analysis of Brouwer's Argument of the Bar Induction (abstract) |
16:30 | On Explicit-Implicit Reflection Principles. (abstract) |
16:50 | Ordinal Notations and Fundamental Sequences in Caucal Hierarchy (abstract) |
17:10 | The maximal order type of the trees with the gap-embeddability relation (abstract) |
17:30 | Computational reverse mathematics and foundational analysis (abstract) |
17:50 | Semantic completeness of first order theories in constructive reverse mathematics (abstract) |
18:10 | Reverse Mathematics, more explicitly (abstract) |
16:30 | A computability approach to three hierarchies (abstract) |
16:50 | A generalization of Solovay's Sigma-construction with application to intermediate models (abstract) |
17:10 | A new lower bound for the length of the hierarchy of norms (abstract) |
17:30 | Unraveling $\Sigma^0_\alpha(\Pi^1_1)$-Determinacy (abstract) |
17:50 | Determinacy of Refinements to the Difference Hierarchy of Co-analytic sets (abstract) |
18:10 | On proof complexities of strong equal modal tautologies. (abstract) |
16:30 | Reducts of simple (non-collapsed) Fraisse-Hrushovski constructions (abstract) |
16:50 | On Jonsson sets and some their properties. (abstract) |
17:10 | Ultraproduct construction of representative utility functions with infinite-dimensional domain (abstract) |
17:30 | An axiomatic approach to modelling of orders of magnitude (abstract) |
17:50 | Elementary numerosities and measures. (abstract) |
16:30 | Differential Galois theory in the class of formally real fields. (abstract) |
16:50 | Around n-dependent fields (abstract) |
17:10 | Some remarks on $\aleph_0$-categorical weakly circularly minimal structures (abstract) |
17:30 | Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types (abstract) |
17:50 | Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes (abstract) |
18:10 | Computing the number of types of infinite tuples (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:15 | Definability, automorphisms and enumeration degrees (abstract) |
11:00 | Tutorial on Stategic and Extensive Games 2 (abstract) |
12:00 | Logic meets number theory in o-minimality (abstract) |
14:30 | Elections and knowledge (abstract) |
15:15 | Nash equilibrium semantics for Independence-Friendly Logic (abstract) |
14:30 | UD-randomness and the Turing degrees (abstract) |
15:15 | On finitely presented expansions of groups and algebras (abstract) |
14:30 | Matrix iterations and Cichoń's diagram (abstract) |
15:15 | Regular cross-sections of Borel flows (abstract) |
14:30 | The place of logic in computer science education (abstract) |
16:30 | Modal logic of clocks: Modalizing a first-order theory of time to get a better understanding of relativity theories (abstract) |
16:50 | Towards a Conditional for The Liar and the Sorites. (abstract) |
17:10 | On graph calculus approach to modalities (abstract) |
17:30 | Complexity of generalized grading with inverse relations and intersection of relations (abstract) |
17:50 | Fuzzy Bsimulation for Standard Godel Modal Logic (abstract) |
18:10 | Hybrid extensions of S4 with the finite model property (abstract) |
16:30 | Almost structurally complete consequence operations extending S4.3 (abstract) |
16:50 | Truth theory for logic of self-reference statements as a quaternion structure (abstract) |
17:10 | A Routley-Meyer semantics for Göodel 3-valued logic G3 (abstract) |
17:30 | Blocking the routes to triviality with depth relevance (abstract) |
16:30 | On the almost sure validities in the finite in some fragments of monadic second-order logic (abstract) |
16:50 | Completeness of second-order separation logic for program verification (abstract) |
17:10 | Infinite Games Specified by 2-Tape Automata (abstract) |
17:30 | Circuit lower bounds in bounded arithmetics (abstract) |
17:50 | Model theory of bounded arithmetic and complexity theory (abstract) |
18:10 | Weak Arithmetical Semantics for the Logic of Proofs (abstract) |
16:30 | Boolean algebras and degrees of autostability relative to strong constructivizations (abstract) |
16:50 | The $ \Delta^{0}_{\alpha} $-dimension of computable structures (abstract) |
17:10 | On categoricity of scattered linear orders (abstract) |
17:30 | A DNC function that computes no effectively bi-immune set (abstract) |
17:50 | Integer-valued randomness and degrees (abstract) |
18:10 | Effective genericity and differentiable functions (abstract) |
16:30 | On $\Sigma^0_2$-initial segments of computable linear orders (abstract) |
16:50 | A non-uniqueness theorem for jumps of principal ideals (abstract) |
17:10 | Every non-zero honest elementary degree has the cupping property (abstract) |
17:30 | Degree spectra of relations on a cone (abstract) |
17:50 | $\Delta_2^0$-spectra of linear orderings (abstract) |
18:10 | Degree spectra of structures under $\Sigma_n$-equivalence. (abstract) |
16:30 | Effective results on the asymptotic behavior of nonexpansive iterations (abstract) |
16:50 | Pi_1 induction axioms vs Pi 1 induction rules (abstract) |
17:10 | Reverse mathematics of WQOs and Noetherian spaces (abstract) |
17:30 | A characterization for diagonalized--out objects (abstract) |
17:50 | Some applications of the Arithmetized Completeness Theorem to second-order arithmetic (abstract) |
18:10 | Some properties of Intuitionistic Set Theory with the principle UP. (abstract) |
16:30 | The complexity of computably enumerable graphs (abstract) |
16:50 | The order dimensions of degree structures (abstract) |
17:10 | Computable numberings in Ershov hierarchy (abstract) |
17:30 | Davies-trees in infinite combinatorics (abstract) |
17:50 | A descriptive set theoretical axiomatization of the Mathias model. (abstract) |
18:10 | Restricting Martin's axiom to a ccc ground model (abstract) |
16:30 | Elementary epimorphisms between models of set theory (abstract) |
16:50 | Generalized Ellentuck spaces and initial Tukey chains of non-p-points (abstract) |
17:10 | Co-analytic ideals on $\omega$ (abstract) |
17:30 | Budding Trees (abstract) |
17:50 | Finite Inseparability of Elementary Theories Based on Connection (abstract) |
16:30 | On various strengthenings of the notion of indivisibility (abstract) |
16:50 | An ordinal rank characterising when Forth suffices (abstract) |
17:10 | Extreme amenability of precompact expansions of countably categorical structures (abstract) |
17:30 | Weak Beth definability property for finite variable fragments. (abstract) |
17:50 | Non-monotonic extensions of the weak Kleene clone with constants (abstract) |
18:10 | A sheaf model of randomness (abstract) |
16:30 | A Defense of Information Economy Principle (abstract) |
16:50 | Prospects for a Naive Theory of Classes (abstract) |
17:10 | On the logical use of implicit contradictions (abstract) |
17:30 | Definable topological dynamics and real Lie groups (abstract) |
17:50 | Topologies on Polish structures (abstract) |
18:10 | Explosiveness, Model Existence, and Incompatible Paraconsistencies (abstract) |
19:00 | VSL Public Lecture: Gödel in Vienna (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
11:00 | Tutorial on Stategic and Extensive Games 3 (abstract) |
12:00 | The Birth of Semantic Entailment (abstract) |
08:45 | VSL Keynote Talk: The theory and applications of o-minimal structures (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:15 | Definable cardinals just beyond R / Q (abstract) |
11:00 | Tutorial on classical realizability and forcing 1 (abstract) |
12:00 | Cardinal invariants and template iterations (abstract) |
15:00 | Generalizations of Hilbert's Tenth Problem (abstract) |
16:30 | Foundations and Technology Competitions Award Ceremony (abstract) |
17:30 | FLoC Olympic Games Award Ceremony 1 (abstract) |
18:15 | FLoC Closing Week 1 (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:15 | Synthesis for monadic logic over the reals (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
View this program: with abstractssession overviewtalk overviewside by side with other conferences
11:00 | On local induction schemes (abstract) |
12:00 | Tutorial on Classical Realizability and Forcing 2 (abstract) |
14:30 | Frege on mathematical progress (abstract) |
15:15 | On Bernays' Generalization of Cantor's Theorem (abstract) |
14:30 | Large cardinals, forcing axioms, and the theory of subsets of \omega_1 (abstract) |
15:15 | Locally definable well-orders (abstract) |
14:30 | Weak well orders and related inductions (abstract) |
15:15 | Automating inductive proof (abstract) |
16:30 | Restrictiveness relative to notions of interpretation (abstract) |
17:15 | Reflection, Trust, Entitlement (abstract) |
16:30 | Definable valuation rings (abstract) |
17:15 | The Fitting subgroup of a supersimple group (abstract) |
18:15 | A completeness theorem for general relativity (abstract) |
18:35 | More On Completion with Horn Filters (abstract) |
18:15 | Predicative Mathematics via Safety Relations (abstract) |
18:35 | Natural Deduction in Renaissance Geometry (abstract) |
18:55 | Aristotle’s conception of demonstration and modern proof theory (abstract) |
18:15 | Modelling Inference in Fiction (abstract) |
18:35 | Metalogical Extensions--Part II: First-order Consequences and Gödel (abstract) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
08:30 | Geometry without points (abstract) |
09:35 | Provability logics and proof-theoretic ordinals (abstract) |
09:55 | On Uniform Interpolation for the Guarded Fragment (abstract) |
09:35 | Degree spectra of sequences of structures (abstract) |
09:55 | Computability in generic extensions (abstract) |
09:35 | Forcing with finite conditions and preserving CH (abstract) |
09:55 | Reflection principle of list-chromatic number of graphs (abstract) |
09:35 | Justifying proof-theoretic reflection principles (abstract) |
09:55 | C. I. Lewis' Influence on the Early Work of Emil Post (abstract) |
09:35 | Indiscernible extraction and Morley sequences (abstract) |
09:55 | Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures (abstract) |
11:00 | Tutorial on Classical Realizability and Forcing 3 (abstract) |
12:00 | Reductions in computability theory from a constructive point of view (abstract) |
14:00 | On a theorem of McAloon (abstract) |
15:00 | The Singular Cardinals Problem after 130 years or so (abstract) |
16:30 | The problem of a model without collection and without exponentiation (abstract) |
17:30 | Computable structure theory and formulas of special forms (abstract) |