Learnability Thesis Does Not Entail Church's Thesis. - Marek Czarnecki; Michal Tomasz Godziszewski; Dariusz Kalocinski (CiE, 2014)

On Computability and Learnability of the Pumping Lemma Function. - Dariusz Kalocinski (LATA, 2014)

Quantifier Learning: An Agent-based Coordination Model. - Dariusz Kalocinski; Nina Gierasimczuk; Marcin Mostowski (AAMAS, 2015)

Communicative and cognitive pressures in semantic alignment. - Dariusz Kalocinski (FADLI@ESSLLI, 2017)

Scalar Language is Shaped by the Statistical Properties of the Environment. - Dariusz Kalocinski (CogSci, 2018)

Interactive Semantic Alignment Model: Social Influence and Local Transmission Bottleneck. - Dariusz Kalocinski; Marcin Mostowski; Nina Gierasimczuk (J. Log. Lang. Inf., 2018)

An Almost Perfectly Predictable Process with No Optimal Predictor. - Dariusz Kalocinski; Tomasz Steifer (ISIT, 2019)

Some Remarks on Least Moduli. - Dariusz Kalocinski (Fundam. Informaticae, 2019)

On unstable and unoptimal prediction. - Dariusz Kalocinski; Tomasz Steifer (Math. Log. Q., 2019)

Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. - Nikolay Bazhenov 001; Dariusz Kalocinski; Michal Wroclawski (STACS, 2022)

Relatively acceptable notation. - Nikolay Bazhenov 001; Dariusz Kalocinski (CoRR, 2022)

Degree Spectra, and Relative Acceptability of Notations. - Nikolay Bazhenov 001; Dariusz Kalocinski (CSL, 2023)

Generalization of Shapiro's theorem to higher arities and noninjective notations. - Dariusz Kalocinski; Michal Wroclawski (Arch. Math. Log., 2023)

Correction to: Generalization of Shapiro's theorem to higher arities and noninjective notations. - Dariusz Kalocinski; Michal Wroclawski (Arch. Math. Log., 2023)

Convexity and Monotonicity in Language Coordination: Simulating the Emergence of Semantic Universals in Populations of Cognitive Agents. - Nina Gierasimczuk; Dariusz Kalocinski; Franciszek Rakowski; Jakub Uszynski (J. Log. Lang. Inf., 2023)

Punctual Presentability in Certain Classes of Algebraic Structures. - Dariusz Kalocinski; Luca San Mauro; Michal Wroclawski (MFCS, 2024)

Online and Feasible Presentability: From Trees to Modal Algebras. - Nikolay Bazhenov 001; Dariusz Kalocinski; Michal Wroclawski (ICALP, 2025)

Degrees of relations on canonically ordered natural numbers and integers. - Nikolay Bazhenov 001; Dariusz Kalocinski; Michal Wroclawski (Arch. Math. Log., 2025)