Jouko A. Väänänen

Orcid: 0000-0003-4356-7974

Affiliations:
  • University of Helsinki, Department of Mathematics and Statistics, Finland


According to our database1, Jouko A. Väänänen authored at least 93 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
When cardinals determine the power set: inner models and Härtig quantifier logic.
Math. Log. Q., November, 2023

An atom's worth of anonymity.
Log. J. IGPL, November, 2023

Positive logics.
Arch. Math. Log., 2023

2022
Tractability Frontier of Data Complexity in Team Semantics.
ACM Trans. Comput. Log., 2022

Modular SAT-based techniques for reasoning tasks in team semantics.
CoRR, 2022

Introduction.
Ann. Pure Appl. Log., 2022

Diversity, dependence and independence.
Ann. Math. Artif. Intell., 2022

2021
Inner models from extended logics: Part 1.
J. Math. Log., 2021

Logicality and Model Classes.
Bull. Symb. Log., 2021

2019
An Extension of a Theorem of Zermelo.
Bull. Symb. Log., 2019

23rd Workshop on Logic, Language, Information and Computation - WoLLIC 2016.
Ann. Pure Appl. Log., 2019

A logical approach to context-specific independence.
Ann. Pure Appl. Log., 2019

2018
Preface.
Ann. Pure Appl. Log., 2018

2017
Dependence logic with generalized quantifiers: Axiomatizations.
J. Comput. Syst. Sci., 2017

23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016).
Log. J. IGPL, 2017

Propositional team logics.
Ann. Pure Appl. Log., 2017

A logic for arguing about probabilities in measure teams.
Arch. Math. Log., 2017

2016
Dependence Logic in pregeometries and <i>ω</i>-stable Theories.
J. Symb. Log., 2016

On the Symbiosis between Model-Theoretic and Set-Theoretic Properties of Large Cardinals.
J. Symb. Log., 2016

Propositional logics of dependence.
Ann. Pure Appl. Log., 2016

Grelling on Dependence.
Proceedings of the Dependence Logic, Theory and Applications, 2016

Introduction.
Proceedings of the Dependence Logic, Theory and Applications, 2016

2015
Quantum Team Logic and Bell's inequalities.
Rev. Symb. Log., 2015

Internal Categoricity in Arithmetic and Set Theory.
Notre Dame J. Formal Log., 2015

Regular Ultrapowers at Regular Cardinals.
Notre Dame J. Formal Log., 2015

Boolean-Valued Second-Order Logic.
Notre Dame J. Formal Log., 2015

Positional Strategies in Long Ehrenfeucht-FraïSSé Games.
J. Symb. Log., 2015

Logics for Dependence and Independence (Dagstuhl Seminar 15261).
Dagstuhl Reports, 2015

Obituary: Jaakko Hintikka 1929-2015.
Bull. Symb. Log., 2015

Pursuing Logic without Borders.
Proceedings of the Logic Without Borders, 2015

The Size of a Formula as a Measure of Complexity.
Proceedings of the Logic Without Borders, 2015

2014
<i>Independence-Friendly Logic: A Game-Theoretic Approach</i>, Allen L. Mann, Gabriel Sandu and Merlijn Sevenster, Cambridge University Press, 2011. Paperback, ISBN 9780521149341, 216 pp.
Theory Pract. Log. Program., 2014

Propositional Logics of Dependence and Independence, Part I.
CoRR, 2014

The Logic of Approximate Dependence.
CoRR, 2014

On Dependence Logic.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013
Editorial Introduction.
Stud Logica, 2013

Dependence and Independence.
Stud Logica, 2013

An Ehrenfeucht-Fraïssé game for Lω1ω.
Math. Log. Q., 2013

On second-order characterizability.
Log. J. IGPL, 2013

Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071).
Dagstuhl Reports, 2013

On Dependence Logic
CoRR, 2013

Axiomatizing first-order consequences in dependence logic.
Ann. Pure Appl. Log., 2013

Independence in Database Relations.
Proceedings of the Logic, Language, Information, and Computation, 2013

Breaking the Atom with Samson.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Second Order Logic, Set Theory and Foundations of Mathematics.
Proceedings of the Epistemology versus Ontology, 2012

The size of a formula as a measure of complexity
CoRR, 2012

Second order logic or set theory?
Bull. Symb. Log., 2012

2011
A Remark on Negation in Dependence Logic.
Notre Dame J. Formal Log., 2011

Erratum to: On Definability in Dependence Logic.
J. Log. Lang. Inf., 2011

On löWenheim-Skolem-Tarski numbers for Extensions of First order Logic.
J. Math. Log., 2011

Chain Models, Trees of singular Cardinality and Dynamic EF-Games.
J. Math. Log., 2011

From IF to BI: a tale of dependence and separation
CoRR, 2011

Models and Games.
Cambridge studies in advanced mathematics 132, Cambridge University Press, ISBN: 978-0-521-51812-3, 2011

2010
Dependence of variables construed as an atomic formula.
Ann. Pure Appl. Log., 2010

2009
From IF to BI.
Synth., 2009

On Definability in Dependence Logic.
J. Log. Lang. Inf., 2009

Lindström theorems for fragments of first-order logic
Log. Methods Comput. Sci., 2009

2008
The Craig Interpolation Theorem in abstract model theory.
Synth., 2008

Regular ultrafilters and finite square principles.
J. Symb. Log., 2008

Introduction to the special theme: Maths for Everyday Life.
ERCIM News, 2008

Preface.
Ann. Pure Appl. Log., 2008

2007
Dependence Logic - A New Approach to Independence Friendly Logic.
London Mathematical Society student texts 70, Cambridge University Press, ISBN: 978-0-521-70015-3, 2007

2006
Recursive logic frames.
Math. Log. Q., 2006

2005
Finite information logic.
Ann. Pure Appl. Log., 2005

A note on extensions of infinitary logic.
Arch. Math. Log., 2005

2004
Barwise: Abstract model theory and generalized quantifiers.
Bull. Symb. Log., 2004

Games played on partial isomorphisms.
Arch. Math. Log., 2004

2002
On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models.
J. Philos. Log., 2002

On the semantics of informational independence.
Log. J. IGPL, 2002

2001
Second-order logic and foundations of mathematics.
Bull. Symb. Log., 2001

2000
Stationary Sets and Infinitary Logic.
J. Symb. Log., 2000

1999
Quantifiers and Congruence Closure.
Stud Logica, 1999

Trees and Ehrenfeucht-Fraïssé Games.
Ann. Pure Appl. Log., 1999

1997
Unary Quantifiers on Finite Models.
J. Log. Lang. Inf., 1997

Definability of Polyadic Lifts of Generalized Quantifiers.
J. Log. Lang. Inf., 1997

Generalized Quantifiers.
Bull. EATCS, 1997

Generalized Quantifiers, an Introduction.
Proceedings of the Generalized Quantifiers and Computation, 1997

1996
The Hierarchy Theorem for Generalized Quantifiers.
J. Symb. Log., 1996

1995
Generalized Quantifiers and Pebble Games on Finite Structures.
Ann. Pure Appl. Log., 1995

1994
Reflection of Long Game Formulas.
Math. Log. Q., 1994

1993
On the Number of Automorphisms of Uncountable Models.
J. Symb. Log., 1993

Trees and Pi<sup>1</sup><sub>1</sub>-Subsets of <sup>omega<sub>1</sub></sup>\omega<sub>1</sub>.
J. Symb. Log., 1993

Game-Theoretic Inductive Definability.
Ann. Pure Appl. Logic, 1993

1992
Partially Ordered Connectives.
Math. Log. Q., 1992

1991
The Härtig Quantifier: A Survey.
J. Symb. Log., 1991

1990
On Scott and Karp Trees of Uncountable Models.
J. Symb. Log., 1990

1989
Henkin and Function Quantifiers.
Ann. Pure Appl. Log., 1989

1984
Vector spaces and binary quantifiers.
Notre Dame J. Formal Log., 1984

1982
Abstract Logic and Set Theory. II. Large Cardinals.
J. Symb. Log., 1982

1981
Decidability of Some Logics with Free Quantifier Variables.
Math. Log. Q., 1981

1980
A Quantifier for Isomorphisms.
Math. Log. Q., 1980

On the Axiomatizability of the Notion of an Automorphism of a Finite Order.
Math. Log. Q., 1980

On orderings of the family of all logics.
Arch. Math. Log., 1980


  Loading...