Carcassi, F., Steinert-Threlkeld, S., Szymanik, J. (2021) Monotone Quantifiers Emerge via Iterated Learning.

Cognitive Science, Vol. 45

Article | https://doi.org/10.1111/cogs.13027 | UvA-DARE

Carcassi, F., Szymanik, J. (2021) The Shape of Modified Numerals.

In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (pp 742-748) (Proceedings of the Annual Meeting of the Cognitive Science Society, Vol. 43). Cognitive Science Society.

Carcassi, F., Szymanik, J. (2021) An Alternatives Account of ‘Most’ and ‘More Than Half’.

Glossa: a journal of general linguistics, Vol. 6

Article | https://doi.org/10.16995/glossa.5764 | UvA-DARE

Carcassi, F., Szymanik, J. (2021) ‘Most’ vs ‘More Than Half’: An Alternatives Explanation.

Proceedings of the Society for Computation in Linguistics, Vol. 4 (pp 334-343)

Article | https://doi.org/10.7275/ej4z-e110 | UvA-DARE

Carcassi, F., Szymanik, J. (2022) Heavy Tails and the Shape of Modified Numerals.

Cognitive Science, Vol. 46

Article | https://doi.org/10.1111/cogs.13176 | UvA-DARE

Carcassi, F., Szymanik, J. (2022) Neural Networks Track the Logical Complexity of Boolean Concepts.

Open Mind, Vol. 6 (pp 132-146)

Article | https://doi.org/10.1162/opmi_a_00059 | UvA-DARE

Carl, M., Galeotti, L., Löwe, B. (2018) The Bolzano-Weierstrass theorem in generalised analysis.

Houston Journal of Mathematics, Vol. 44 (pp 1081-1109)

Article | https://preprint.math.uni-hamburg.de/public/papers/hbm/hbm752.pdf | UvA-DARE

Carl, M., Galeotti, L., Passmann, R. (2021) Randomising Realizability.

In De Mol, L. Weiermann, A. Manea, F. Fernández-Duque, D. (Eds.), Connecting with Computability: 17th Conference on Computability in Europe, CiE 2021, virtual event, Ghent, July 5–9, 2021 : proceedings (pp 82-93) (Lecture Notes in Computer Science, Vol. 12813). Springer.

Carl, M., Galeotti, L., Passmann, R. (2023) Realisability for infinitary intuitionistic set theory.

Annals of Pure and Applied Logic, Vol. 174

Article | https://doi.org/10.1016/j.apal.2023.103259 | UvA-DARE

Carrara, M., Mancini, F., Smid, Jeroen (2022) On the Overlap Between Everything and Nothing.

Logic and Logical Philosophy, Vol. 31 (pp 143-160)

Article | https://doi.org/10.12775/LLP.2021.013 | UvA-DARE

Carrara, M., Smid, Jeroen (2022) There is Overlap in Letters: A Mereological Definition of Word Types.

Synthese, Vol. 200

Article | https://doi.org/10.1007/s11229-022-03664-4 | UvA-DARE

Carrara, M., Smid, Jeroen (2022) On Cotnoir’s Two Notions of Proper Parthood.

Philosophical Studies, Vol. 179 (pp 2787–2795)

Article | https://doi.org/10.1007/s11098-022-01795-5 | UvA-DARE

Carreiro, F., Facchini, A., Venema, Y., Zanasi, F. (2014) Weak MSO: automata and expressiveness modulo bisimilarity.

In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS): Vienna, Austria - July 14-18, 2014 . ACM.

Carreiro, F., Facchini, A., Venema, Y., Zanasi, F. (2020) The power of the weak.

ACM Transactions on Computational Logic, Vol. 21

Article | https://doi.org/10.1145/3372392 | UvA-DARE

Carreiro, F., Facchini, A., Venema, Y., Zanasi, F. (2022) Model theory of monadic predicate logic with the infinity quantifier.

Archive for Mathematical Logic, Vol. 61 (pp 465-502)

Article | https://doi.org/10.1007/s00153-021-00797-0 | UvA-DARE

Carreiro, F., Gorín, D., Schröder, L. (2013) Coalgebraic Announcement Logics.

In Fomin, F.V. Freivalds, R. Kwiatkowska, M. Peleg, D. (Eds.), Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013 : proceedings (pp 101-112) (Lecture Notes in Computer Science
Advanced Research in Computing and Software Science, Vol. 7966). Springer.

Carreiro, F., Venema, Y. (2014) PDL Inside the μ-calculus: A Syntactic and an Automata-theoretic Characterization.

In Goré, R. Kooi, B. Kurucz, A. (Eds.), Advances in Modal Logic: AiML 10 (pp 74-93). College Publications.

Carreiro, F. (2015) PDL is the bisimulation-invariant fragment of Weak Chain Logic.

In Proceedings, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science: LICS 2015: 6-10 July 2015, Kyoto, Japan (pp 341-352). IEEE Computer Society.

Carreiro, F.M. (2015) Fragments of fixpoint logics: Automata and expressiveness.

Thesis, fully internal | UvA-DARE

Carriero, Valentina Anita, Ciroku, Fiorela, de Berardinis, Jacopo, Martinez Pandiani, Delfina S., Meroño-Peñuela, Albert, Poltronieri, Andrea, Presutti, Valentina (2021) Semantic Integration of MIR Datasets with the Polifonia Ontology Network.

Poster | https://archives.ismir.net/ismir2021/latebreaking/000020.pdf | UvA-DARE