Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
View all
All
Since 2020
Citations
24
12
h-index
2
2
i10-index
1
0
0
6
3
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
1
1
2
2
4
2
2
5
2
1
Follow
Marek Czarnecki
Uniwersytet Warszawski
Verified email at uw.edu.pl
matgematical logic
computability theory
potential infinity
Articles
Cited by
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
How fast can the fixpoints in modal µ-calculus be reached
M Czarnecki
Fixed Points in Computer Science, 35-39
, 2010
18
2010
A modal logic of a truth definition for finite models
M Czarnecki, K Zdanowski
Fundamenta Informaticae 164 (4), 299-325
, 2019
6
2019
Learnability Thesis Does Not Entail Church’s Thesis
M Czarnecki, MT Godziszewski, D Kalociński
Language, Life, Limits: 10th Conference on Computability in Europe, CiE 2014 …
, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–3
Show more
Privacy
Terms
Help
About Scholar
Search help
