Consequences of a Goedel's misjudgment

The fundamental aim of the paper is to correct an harmful way to interpret a Goedel's erroneous remark at the Congress of Koenigsberg in 1930. Despite the Goedel's fault is rather venial, its misreading has produced and continues to produce dangerous fruits, as to apply the incompleteness Theorems to the full second-order Arithmetic and to deduce the semantic incompleteness of its language by these same Theorems. The first three paragraphs are introductory and serve to define the languages inherently semantic and its properties, to discuss the consequences of the expression order used in a language and some question about the semantic completeness: in particular is highlighted the fact that a non-formal theory may be semantically complete despite using a language semantically incomplete. Finally, an alternative interpretation of the Goedel's unfortunate comment is proposed. KEYWORDS: semantic completeness, syntactic incompleteness, categoricity, arithmetic, second-order languages, paradoxesComment: English version, 19 pages. Fixed and improved terminolog

Proof theoretic criteria for logical constancy

Logic concerns inference, and some inferences can be distinguished from others by their holding as a matter of logic itself, rather than say empirical factors. These inferences are known as logical consequences and have a special status due to the strong level of confidence they inspire. Given this importance, this dissertation investigates a method of separating the logical from the non-logical. The method used is based on proof theory, and builds on the work of Prawitz, Dummett and Read. Requirements for logicality are developed based on a literature review of common philosophical use of the term, with the key factors being formality, and the absolute generality / topic neutrality of interpretations of logical constants. These requirements are used to generate natural deduction criteria for logical constancy, resulting in the classification of certain predicates, truth functional propositional operators, first order quantifiers, second order quantifiers in sound and complete formal systems using Henkin semantics, and modal operators from the systems K and S5 as logical constants. Semantic tableaux proof systems are also investigated, resulting in the production of semantic tableaux-based criteria for logicality

How to Find Suitable Ontologies Using an Ontology-based WWW Broker

Knowledge reuse by means of outologies now faces three important problems: (1) there are no standardized identifying features that characterize ontologies from the user point of view; (2) there are no web sites using the same logical organization, presenting relevant information about ontologies; and (3) the search for appropriate ontologies is hard, time-consuming and usually fruitless. To solve the above problems, we present: (1) a living set of features that allow us to characterize ontologies from the user point of view and have the same logical organization; (2) a living domain ontology about ontologies (called ReferenceOntology) that gathers, describes and has links to existing ontologies; and (3) (ONTO)2Agent, the ontology-based www broker about ontologies that uses the Reference Ontology as a source of its knowledge and retrieves descriptions of ontologies that satisfy a given set of constraints. (ONTO)~Agent is available at http://delicias.dia.fi.upm.es/REFERENCE ONTOLOGY

Specifying collaborative software: a proposal

The aim of this paper is to illustrate how formal specifications for collaborative interactive systems might be written. It presents a new modelling paradigm for certain systems. It also shows how formal software engineering approaches can be useful. Specifically we choose to specify a simple collaborative editor. This example serves two purposes: it shows how clear and simple a formal specification can be and it provides a basis for making observations about the requirements for a specification language where the target is CSCW systems. The specification of the system has three parts: the semantics of the system; the syntax of the system; the semantics of the collaborative aspects of the system

On handling urban informality in southern Africa

In this article I reconsider the handling of urban informality by urban planning and management systems in southern Africa. I argue that authorities have a fetish about formality and that this is fuelled by an obsession with urban modernity. I stress that the desired city, largely inspired by Western notions of modernity, has not been and cannot be realized. Using illustrative cases of top–down interventions, I highlight and interrogate three strategies that authorities have deployed to handle informality in an effort to create or defend the modern city. I suggest that the fetish is built upon a desire for an urban modernity based on a concept of formal order that the authorities believe cannot coexist with the “disorder” and spatial “unruliness” of informality. I question the authorities' conviction that informality is an abomination that needs to be “converted”, dislocated or annihilated. I conclude that the very configuration of urban governance and socio-economic systems in the region, like the rest of sub-Saharan Africa, renders informality inevitable and its eradication impossible

COMPLIANCE TO QUALITY CRITERIA OF EXISTING REQUIREMENTS ELICITATION METHODS

In this article we define a requirements elicitation method based on natural language modelling. We argue that our method complies with synthesized quality criteria for RE methods, and compare this with the compliance of traditional RE methods (EER, ORM, UML). We show limited empirical evidence to support our theoretical argument.computer science applications;

Logical Pluralism: Where the Conflict Really Lies

Recent years have seen a surge of attention to the problem of logical pluralism; most of which has been a reaction to Beall and Restall’s account of logical pluralism as the existence of more than one equally correct semantic relation of logical consequence. The underlying thesis is that the indeterminacy of the notion of validity goes beyond what the inductive-deductive distinction can precisify. The notion of deductive validity itself is indeterminate as well and this indeterminacy has its roots in the indeterminacy of the more fundamental notion of case. Cases are what make the premisses and the conclusion of an argument true; the most notable example being Tarskian models for classical logic. Deductive validity is the preservation of truth across all cases. This paper argues that unless this account of logical pluralism is supplemented with an argument in favor of the equal legitimacy of the purported cases it becomes merely a semi-controversial exposition of how different logics can be generated