Michal Krynicki

According to our database1, Michal Krynicki authored at least 19 papers between 1979 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
Theories of initial segments of standard models of arithmetics and their complete extensions.
Theor. Comput. Sci., 2011

2007
Games on Trees and Syntactical Complexity of Formulas.
Logic Journal of the IGPL, 2007

Finite Arithmetics.
Fundam. Inform., 2007

2005
Theories of arithmetics in finite models.
J. Symb. Log., 2005

1993
Hierarchies of Partially Ordered Connectives and Quantifiers.
Math. Log. Q., 1993

1992
Decidability Problems in Languages with Henkin Quantifiers.
Ann. Pure Appl. Logic, 1992

1991
Remarks on The Cartesian Closure.
Math. Log. Q., 1991

An Axiomatization of the Logic with the Rough Quantifier.
J. Symb. Log., 1991

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

1990
On simplicity of formulas.
Studia Logica, 1990

Quantifiers determined by partial orderings.
Math. Log. Q., 1990

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

1988
The non-definability notion and first order logic.
Studia Logica, 1988

Notion of Interpretation and Nonelementary Languages.
Math. Log. Q., 1988

1987
A note on syntactical and semantical functions.
Studia Logica, 1987

On Some Applications of Games for Härtig Quantifier.
Math. Log. Q., 1987

1984
Vector spaces and binary quantifiers.
Notre Dame Journal of Formal Logic, 1984

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

1979
On the Semantics of the Henkin Quantifier.
J. Symb. Log., 1979


  Loading...