Dariusz Kalocinski

Orcid: 0000-0002-3044-525X

According to our database1, Dariusz Kalocinski authored at least 15 papers between 2014 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Convexity and Monotonicity in Language Coordination: Simulating the Emergence of Semantic Universals in Populations of Cognitive Agents.
J. Log. Lang. Inf., October, 2023

Correction to: Generalization of Shapiro's theorem to higher arities and noninjective notations.
Arch. Math. Log., 2023

Generalization of Shapiro's theorem to higher arities and noninjective notations.
Arch. Math. Log., 2023

Degree Spectra, and Relative Acceptability of Notations.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Relatively acceptable notation.
CoRR, 2022

Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2019
On unstable and unoptimal prediction.
Math. Log. Q., 2019

Some Remarks on Least Moduli.
Fundam. Informaticae, 2019

An Almost Perfectly Predictable Process with No Optimal Predictor.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Interactive Semantic Alignment Model: Social Influence and Local Transmission Bottleneck.
J. Log. Lang. Inf., 2018

Scalar Language is Shaped by the Statistical Properties of the Environment.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

2017
Communicative and cognitive pressures in semantic alignment.
Proceedings of the Workshop on Formal Approaches to the Dynamics of Linguistic Interaction 2017 co-located within the European Summer School on Logic, 2017

2015
Quantifier Learning: An Agent-based Coordination Model.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
On Computability and Learnability of the Pumping Lemma Function.
Proceedings of the Language and Automata Theory and Applications, 2014

Learnability Thesis Does Not Entail Church's Thesis.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014


  Loading...