Nicola Angius
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nicola Angius has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Alessio Plebe
Department of Cognitive Science, University of Messina, Messina, Italy
3 shared publications - Giuseppe Primiero
Università degli Studi di Milano
3 shared publications Petros Stefaneas
Department of Mathematics National Technical University of Athens Zografou Greece
2 shared publications- Petros Stefaneas
National Technical University of Athens
2 shared publications - Alessandro Acciai
Department of Cognitive Sciences, University of Messina, Messina, Italy
1 shared publication Guglielmo Tamburrini
University of Sassari
1 shared publication
Latest Publications
- 17 September 2026
- Published by Springer Nature in Philosophy & Technology
- Vol. 39 (4) , 179
When Correctness is Not Enough: Symbolic AI and the Certainty–Scope Conjecture
- 17 September 2026
- Published by Springer Nature in Philosophy & Technology
- Vol. 39 (4) , 179
When Correctness is Not Enough: Symbolic AI and the Certainty–Scope Conjecture
- Open Access
- 27 June 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (4) , 78
A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories
This paper introduces a meta-logical framework—based on the theory of institutions (a categorical version of abstract model theory)—to be used as a tool for the formalization of the two main views regarding the structure of scientific theories, namely the syntactic and the semantic views, as they have emerged from the relevant contemporary discussion. The formalization leads to a proof of the equivalence of the two views, which supports the claim that the two approaches are not really in tension. The proof is based on the Galois connection between classes of sentences and classes of models defined over some institution. First, the history of the syntactic–semantic debate is recalled and the theory of institutions formally introduced. Secondly, the notions of syntactic and semantic theories are formalized within the institution and their equivalence proved. Finally, the novelty of the proposed framework is highlighted with respect to existing formalizations.
- 27 June 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (4) , 78
Open AccessA Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories
This paper introduces a meta-logical framework—based on the theory of institutions (a categorical version of abstract model theory)—to be used as a tool for the formalization of the two main views regarding the structure of scientific theories, namely the syntactic and the semantic views, as they have emerged from the relevant contemporary discussion. The formalization leads to a proof of the equivalence of the two views, which supports the claim that the two approaches are not really in tension. The proof is based on the Galois connection between classes of sentences and classes of models defined over some institution. First, the history of the syntactic–semantic debate is recalled and the theory of institutions formally introduced. Secondly, the notions of syntactic and semantic theories are formalized within the institution and their equivalence proved. Finally, the novelty of the proposed framework is highlighted with respect to existing formalizations.
- Open Access
- 1 April 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (2) , 40
Meaning and Reference in Programming Languages
This paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages. Addressing the problem is relevant for the philosophy of computer science in the context of the debate of whether simulative programs can be considered representational theories of their simulated systems. This paper challenges the thesis that, since programming languages have semantics, they also have reference, presumably to the external world. First, denotational, operational, game theoretic, and axiomatic semantics are epistemologically analysed to provide a theory of meaning for high-level language programs. It is argued that programming language semantics can be seen, to some extent, under the light of Fregean descriptivism, thereby rejecting the view that it is reference that determines meaning. Secondly, descriptivist, causal, character, and intentionalist theories of reference are examined to argue that meaning is not sufficient for programming languages to determine reference, thereby rejecting the view that meaning determines reference. It is argued that it is the intentions of agents that allow programming language semantics to identify referents. The paper concludes that if the semantics of programming languages may determine their reference, the latter is not to the external world but to the internal operations of the implementation executing them. This does not prevent simulative programs from representing empirical systems, but they do so not on the basis of programming language semantics.
- 1 April 2025
- Published by MDPI AG in Philosophies
- Vol. 10 (2) , 40
Open AccessMeaning and Reference in Programming Languages
This paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages. Addressing the problem is relevant for the philosophy of computer science in the context of the debate of whether simulative programs can be considered representational theories of their simulated systems. This paper challenges the thesis that, since programming languages have semantics, they also have reference, presumably to the external world. First, denotational, operational, game theoretic, and axiomatic semantics are epistemologically analysed to provide a theory of meaning for high-level language programs. It is argued that programming language semantics can be seen, to some extent, under the light of Fregean descriptivism, thereby rejecting the view that it is reference that determines meaning. Secondly, descriptivist, causal, character, and intentionalist theories of reference are examined to argue that meaning is not sufficient for programming languages to determine reference, thereby rejecting the view that meaning determines reference. It is argued that it is the intentions of agents that allow programming language semantics to identify referents. The paper concludes that if the semantics of programming languages may determine their reference, the latter is not to the external world but to the internal operations of the implementation executing them. This does not prevent simulative programs from representing empirical systems, but they do so not on the basis of programming language semantics.
- Open Access
- 29 August 2024
- Published by MDPI AG in Philosophies
- Vol. 9 (5) , 137
The Simulative Role of Neural Language Models in Brain Language Processing
This paper provides an epistemological and methodological analysis of the recent practice of using neural language models to simulate brain language processing. It is argued that, on the one hand, this practice can be understood as an instance of the traditional simulative method in artificial intelligence, following a mechanistic understanding of the mind; on the other hand, that it modifies the simulative method significantly. Firstly, neural language models are introduced; a study case showing how neural language models are being applied in cognitive neuroscience for simulative purposes is then presented; after recalling the main epistemological features of the simulative method in artificial intelligence, it is finally highlighted how the epistemic opacity of neural language models is tackled by using the brain itself to simulate the neural language model and to test hypotheses about it, in what is called here a co-simulation.
- 29 August 2024
- Published by MDPI AG in Philosophies
- Vol. 9 (5) , 137
Open AccessThe Simulative Role of Neural Language Models in Brain Language Processing
This paper provides an epistemological and methodological analysis of the recent practice of using neural language models to simulate brain language processing. It is argued that, on the one hand, this practice can be understood as an instance of the traditional simulative method in artificial intelligence, following a mechanistic understanding of the mind; on the other hand, that it modifies the simulative method significantly. Firstly, neural language models are introduced; a study case showing how neural language models are being applied in cognitive neuroscience for simulative purposes is then presented; after recalling the main epistemological features of the simulative method in artificial intelligence, it is finally highlighted how the epistemic opacity of neural language models is tackled by using the brain itself to simulate the neural language model and to test hypotheses about it, in what is called here a co-simulation.
- 15 July 2024
- Published by Wiley in Metaphilosophy
- Vol. 55 (3) , 440-456
The logical structure of modular semantic theories of software systems
This paper studies the structure of semantic theories over modular computational systems and applies the algebraic Theory of Institutions to provide a logical representation of such theories. A modular semantic theory is here defined by a cluster of semantic theories, each for a single program's module, and by a set of relations connecting models of different semantic theories. A semantic theory of a single module is provided in terms of the set of ∑‐models mapped from the category Th of ∑‐theories and generating a hierarchy of structures from an abstract model to a concrete model of data. The collection of abstract models representing different modules of a program is formalised as the category of institutions INS, where theory morphisms express refinements, integrations, and compositions between couples of modules. Finally, it is required that a morphism in INS at any level occurs iff the same morphism occurs at the lower level alongside the Th hierarchy.
- 15 July 2024
- Published by Wiley in Metaphilosophy
- Vol. 55 (3) , 440-456
The logical structure of modular semantic theories of software systems
This paper studies the structure of semantic theories over modular computational systems and applies the algebraic Theory of Institutions to provide a logical representation of such theories. A modular semantic theory is here defined by a cluster of semantic theories, each for a single program's module, and by a set of relations connecting models of different semantic theories. A semantic theory of a single module is provided in terms of the set of ∑‐models mapped from the category Th of ∑‐theories and generating a hierarchy of structures from an abstract model to a concrete model of data. The collection of abstract models representing different modules of a program is formalised as the category of institutions INS, where theory morphisms express refinements, integrations, and compositions between couples of modules. Finally, it is required that a morphism in INS at any level occurs iff the same morphism occurs at the lower level alongside the Th hierarchy.
- 7 November 2023
- Published by Springer Nature in Global Philosophy
- Vol. 33 (6) , 1-14
Central Themes and Open Questions in the Philosophy of Computer Science
- 7 November 2023
- Published by Springer Nature in Global Philosophy
- Vol. 33 (6) , 1-14
Central Themes and Open Questions in the Philosophy of Computer Science
- 5 November 2023
- Published by Springer Nature in Metascience
- Vol. 33 (1) , 1-4
What is (the philosophy of) computer science?
- 5 November 2023
- Published by Springer Nature in Metascience
- Vol. 33 (1) , 1-4
What is (the philosophy of) computer science?
- 25 July 2023
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 33 (5) , 1089-1117
Copying safety and liveness properties of computational artefacts
This paper shows how safety and liveness properties are not necessarily preserved by different kinds of copies of computational artefacts and proposes procedures to preserve them, which are consistent with ethical analyses on software property rights infringement. Safety and liveness are second-order properties that are crucial in the definition of the formal ontology of computational artefacts. Software copies are analysed at the level of their formal models as exact, inexact and approximate copies, according to the taxonomy in []. First, it is explained how exact copies are the only kind of copies that preserve safety and liveness properties, and how inexact and approximate copies do not necessarily preserve them. Secondly, two model checking algorithms are proposed to verify whether inexact and approximate copies actually preserve safety and liveness properties. Essential properties of termination, correctness and complexity are proved for these algorithms. Finally, contraction and expansion algorithmic operations are defined, allowing for the automatic design of safety- and liveness-preserving approximate copies. As a conclusion, the relevance of the present logical analysis for the ongoing debates in miscomputation and computer ethics is highlighted.
- 25 July 2023
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 33 (5) , 1089-1117
Copying safety and liveness properties of computational artefacts
This paper shows how safety and liveness properties are not necessarily preserved by different kinds of copies of computational artefacts and proposes procedures to preserve them, which are consistent with ethical analyses on software property rights infringement. Safety and liveness are second-order properties that are crucial in the definition of the formal ontology of computational artefacts. Software copies are analysed at the level of their formal models as exact, inexact and approximate copies, according to the taxonomy in []. First, it is explained how exact copies are the only kind of copies that preserve safety and liveness properties, and how inexact and approximate copies do not necessarily preserve them. Secondly, two model checking algorithms are proposed to verify whether inexact and approximate copies actually preserve safety and liveness properties. Essential properties of termination, correctness and complexity are proved for these algorithms. Finally, contraction and expansion algorithmic operations are defined, allowing for the automatic design of safety- and liveness-preserving approximate copies. As a conclusion, the relevance of the present logical analysis for the ongoing debates in miscomputation and computer ethics is highlighted.
- 5 July 2023
- Published by Springer Nature in Philosophy & Technology
- Vol. 36 (3) , 1-27
From Coding To Curing. Functions, Implementations, and Correctness in Deep Learning
- 5 July 2023
- Published by Springer Nature in Philosophy & Technology
- Vol. 36 (3) , 1-27
From Coding To Curing. Functions, Implementations, and Correctness in Deep Learning
- 21 November 2022
- Published by Springer Nature in Axiomathes
- Vol. 32 (S3) , 1221-1236
On the Experimental Foundation of Computing
- 21 November 2022
- Published by Springer Nature in Axiomathes
- Vol. 32 (S3) , 1221-1236
On the Experimental Foundation of Computing