Search

Fault diagnosis with formal languages can be performed in an interpretable way. However, the traditional formal languages cannot deal with noisy environments. Additionally, finding the optimal formal language for fault diagnosis is still a challenge due to the sparse reward issue. This article presents a novel method to find formal languages, written with signal spectral logic (SSL), to describe the fault behaviors among frequency domain for fault diagnosis. The formal language defined by SSL is robust to noise, acts as the fault diagnoser, and provides interpretabilities for human operators. Moreover, the fault diagnoser construction procedure has been formulated as a language generation process and an adversarial training technique is used to find the optimal formal language and avoid sparse reward issue existing in language generation problems. Some experiments with real rolling element bearing data and simulated signals demonstrate that our method is able to find formal languages to diagnose faults efficiently and accurately under noisy environments. [ABSTRACT FROM AUTHOR]

We define rough-set-like approximation spaces for formal languages based on similarity relations which are defined over the alphabet symbols. Our approach is motivated by situations when some uncertainty is present in our knowledge about the exact characters making up a text which need to be processed by some formal system. We define the lower and upper approximations of languages and consider the regular and context-free cases. We present characterizations of the approximations of languages accepted by deterministic finite automata or generated by context-free grammars. [ABSTRACT FROM AUTHOR]

The article consists of various personal and academic messages dedicated to Jürgen Dassow on his 75th birthday. It highlights his significant contributions to the fields of grammar systems, automata theory, and formal languages. Several colleagues reflect on their collaborations with Dassow, noting his impact on research and mentorship.

This research aimed to discover the characteristics of formal and informal talks of lecturers in EFL classroom. This research was conducted in qualitative design. Furthermore, the researcher applied discourse analysis under the study of sociolinguistics as an approach to analyze the language, writing, speech, and conversation (verbal and nonverbal) that was appropriate with the purpose of this research. In order to get the data, the researcher did observation and recording. Lastly, the result of the data analysis was presented in description of words, not number. The research was conducted at English Study Program of IAIN Bone. The result shows that the lecturers used formal and informal language. However, the lecturers used formal talk dominantly rather than the informal talk. The characteristic of formal talk which was frequently used by teacher was full form. The teacher frequently used this characteristic in asking question. Whereas informal talk happened frequently when teacher gave explanation particularly in explaining the material. The formal talks which occurred in EFL classroom particularly in student talk consist of four characteristics. They were neutral lexis, full form, politeness phenomena, careful turn taking and title in which using title mostly occurred in interaction among teacher and students. The informal talks which occurred in EFL classroom particularly in student talks were colloquial lexis, interruption/overlapping, first name and nickname, typical mood choice and modal for probability. [ABSTRACT FROM AUTHOR]

Copyright of Revista Brasileira de Linguística Antropológica is the property of Revista Brasileira de Linguística Antropológica and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Revista Miradas is the property of Universidad Tecnologica de Pereira and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Contrastes: Revista Internacional de Filosofia is the property of Contrastes: Revista Internacional de Filosofia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

If $\mathcal {A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal {A}^{\mathbb {N}}$ of sequences with entries in $\mathcal {A}$ , along with the left shift operator S. Closed S-invariant subsets are called subshifts and arise naturally as encodings of other systems. In this paper, we study the number of ergodic measures for transitive subshifts under a condition ('regular bispecial condition') on the possible extensions of words in the associated language. Our main result shows that under this condition, the subshift can support at most $({K+1})/{2}$ ergodic measures, where K is the limiting value of $p(n+1)-p(n)$ , and p is the complexity function of the language. As a consequence, we answer a question of Boshernitzan from 1984, providing a combinatorial proof for the bound on the number of ergodic measures for interval exchange transformations. [ABSTRACT FROM AUTHOR]

Copyright of Revista de Investigación Lingüística is the property of Servicio de Publicaciones de la Universidad de Murcia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We can believe that the Culture of Vision is the disciplinary area in which various creative projects mature, to be considered in the specific definitions and variations, that the contribution will analyze: urban art, street art, murals, Aerosol Writhing, graffiti, (especially the latter also evaluated in their critical issues) with their respective areas and protagonists. In the contemporary world, English Bansky [1] is one of the best known protagonists. His works (messages and representations with an immediate, almost silhouette, polemical-satirical and political background) are made using the stencil technique. In the contemporary international scene there is the maturation of a complex phenomenon which, as an “amateurish” and “spontaneist”, often takes the form of a true artistic manifestation, with precise cultural references, by each individual author knowingly and programmatically adopted and shared. In general, these practices are able to transform through their universally recognizable visual codes - as we will clarify later - the perceptual impact of a building, a street, an entire neighborhood: this language orientates and creates harmony through visual hierarchies, which can be programmed and controlled.This is because one of the most widespread and significant areas of application concerns the recovery and redevelopment in cities, even in less well-kept areas (when not abandoned) both in urban centers and in peripheral areas, characterized by the lack of formal identities and cultures, communities and landscapes within them.DOI: https://doi.org/10.20365/disegnarecon.24.2020.16

The foundational features of multi-agent systems are communication and interaction with other agents. To achieve these features, agents have to transfer messages in the predefined format and semantics. The communication among these agents takes place with the help of ACL (Agent Communication Language). ACL is a predefined language for communication among agents that has been standardised by the FIPA (Foundation for Intelligent Physical Agent). FIPA-ACL defines different performatives for communication among the agents. These performatives are generic, and it becomes computationally expensive to use them for a specific domain like e-commerce. These performatives do not define the exact meaning of communication for any specific domain like e-commerce. In the present research, we introduced new performatives specifically for e-commerce domain. Our designed performatives are based on FIPA-ACL so that they can still support communication within diverse agent platforms. The proposed performatives are helpful in modelling e-commerce negotiation protocol applications using the paradigm of multi-agent systems for efficient communication. For exact semantic interpretation of the proposed performatives, we also performed formal modelling of these performatives using BNF. The primary objective of our research was to provide the negotiation facility to agents, working in an e-commerce domain, in a succinct way to reduce the number of negotiation messages, time consumption and network overhead on the platform. We used an e-commerce based bidding case study among agents to demonstrate the efficiency of our approach. The results showed that there was a lot of reduction in total time required for the bidding process.

In this work, computer-assisted writing techniques for linear expressions of the structure of polycyclic molecules, branched molecules and clusters, based on formal languages, are tested. The techniques used only require the ability to process written texts, even just using a text editor, and one of the many available molecular drawing/optimization programs that accept input in the form of a SMILES string. A few specific syntactic operators acting on strings are characterized in terms of their effect on the corresponding structure, and although they are simply examples, they are already capable of producing non-trivial structures. The aim of this work is to encourage experiments that may lead to potentially interesting molecular schemata, in view of their symmetry and stereochemistry, as revealed by optimization, and to develop insight into the connection between formal expressions and structures. Given the simplicity and availability of the required tools, it can also be useful for education.

Cybercriminals have become an imperative threat because they target the most valuable resource on earth, data. Organizations prepare against cyber attacks by creating Cyber Security Incident Response Teams (CSIRTs) that use various technologies to monitor and detect threats and to help perform forensics on machines and networks. Testing the limits of defense technologies and the skill of a CSIRT can be performed through adversary emulation performed by so-called "red teams". The red team's work is primarily manual and requires high skill. We propose SpecRep, a system to ease the testing of the detection capabilities of defenses in complex, heterogeneous infrastructures. SpecRep uses previously known attack specifications to construct attack scenarios based on attacker objectives instead of the traditional attack graphs or a list of actions. We create a metalanguage to describe objectives to be achieved in an attack together with a compiler that can build multiple attack scenarios that achieve the objectives. We use text processing tools aided by large language models to extract information from freely available white papers and convert them to plausible attack specifications that can then be emulated by SpecRep. We show how our system can emulate attacks against a smart home, a large enterprise, and an industrial control system.

Graph databases have received much attention as of late due to numerous applications in which data is naturally viewed as a graph; these include social networks, RDF and the Semantic Web, biological databases, and many others. There are many proposals for query languages for graph databases that mainly fall into two categories. One views graphs as a particular kind of relational data and uses traditional relational mechanisms for querying. The other concentrates on querying the topology of the graph. These approaches, however, lack the ability to combine data and topology, which would allow queries asking how data changes along paths and patterns enveloping it. In this article, we present a comprehensive study of languages that enable such combination of data and topology querying. These languages come in two flavors. The first follows the standard approach of path queries, which specify how labels of edges change along a path, but now we extend them with ways of specifying how both labels and data change. From the complexity point of view, the right type of formalisms are subclasses of register automata. These, however, are not well suited for querying. To overcome this, we develop several types of extended regular expressions to specify paths with data and study their querying power and complexity. The second approach adopts the popular XML language XPath and extends it from XML documents to graphs. Depending on the exact set of allowed features, we have a family of languages, and our study shows that it includes efficient and highly expressive formalisms for querying both the structure of the data and the data itself. [ABSTRACT FROM AUTHOR]

Professor Jane Hillston is one of the winners of 2023's Lovelace Medal. She discusses her work with Brian Runciman MBCS. [ABSTRACT FROM AUTHOR]

The Journal of English-Medium Instruction has a section called EMI Book Alerts that provides updates on recently published books related to EMI research. The purpose of this section is to assist the research and teaching community by keeping them informed about relevant books. The books included in the list cover topics such as theoretical, methodological, and empirical issues related to EMI and multilingual pedagogies in educational contexts where English is the formal instructional language. Readers are encouraged to send book recommendations to the journal's Book Review Editor, Amy Ou. The complete EMI Books List can be found on the journal's website. [Extracted from the article]

Program verification consists in finding a formal proof that the program satisfies a given specification. This specification can be described as assertions about the input and output a correct program must satisfy. Assertions and programs are traditionally specified in terms of classical first order logic (FOL). FOL reasoners (inference systems) automatically find the correspondent program correctness proof, if any. However, verification of programs with mutable data structures, such as pointers, is currently a major challenge for the FOL assertion based approach. Mutable data structures are often written in terms of syntactically unrelated expressions, whose specification represents a significant defiance for FOL. Separation logics are a family of formal languages with specially-purposed constructors designed to model mutable data structures. In this paper, we formally verify a database management system using separation logics. We focused on the verification of libraries containing programs about heap manipulation. Several detected bugs are described in detail, respective solutions are also provided. [ABSTRACT FROM AUTHOR]

Complex event recognition (CER) has emerged as the unifying field for technologies that require processing and correlating distributed data sources in real time. CER finds applications in diverse domains, which has resulted in a large number of proposals for expressing and processing complex events. Existing CER languages lack a clear semantics, however, which makes them hard to understand and generalize. Moreover, there are no general techniques for evaluating CER query languages with clear performance guarantees. In this article, we embark on the task of giving a rigorous and efficient framework to CER. We propose a formal language for specifying complex events, called complex event logic (CEL), that contains the main features used in the literature and has a denotational and compositional semantics. We also formalize the socalled selection strategies, which had only been presented as by-design extensions to existing frameworks. We give insight into the language design trade-offs regarding the strict sequencing operators of CEL and selection strategies. With a well-defined semantics at hand, we discuss how to efficiently process complex events by evaluating CEL formulas with unary filters. We start by introducing a formal computational model for CER, called complex event automata (CEA), and study how to compile CEL formulas with unary filters into CEA. Furthermore, we provide efficient algorithms for evaluating CEA over event streams using constant time per event followed by output-linear delay enumeration of the results. [ABSTRACT FROM AUTHOR]

According to the structured theory of propositions, if two sentences express the same proposition, then they have the same syntactic structure, with corresponding syntactic constituents expressing the same entities. A number of philosophers have recently focused attention on a powerful argument against this theory, based on a result by Bertrand Russell, which shows that the theory of structured propositions is inconsistent in higher order-logic. This paper explores a response to this argument, which involves restricting the scope of the claim that propositions are structured, so that it does not hold for all propositions whatsoever, but only for those which are expressible using closed sentences of a given formal language. We call this restricted principle Closed Structure, and show that it is consistent in classical higher-order logic. As a schematic principle, the strength of Closed Structure is dependent on the chosen language. For its consistency to be philosophically significant, it also needs to be consistent in every extension of the language which the theorist of structured propositions is apt to accept. But, we go on to show, Closed Structure is in fact inconsistent in a very natural extension of the standard language of higher-order logic, which adds resources for plural talk of propositions. We conclude that this particular strategy of restricting the scope of the claim that propositions are structured is not a compelling response to the argument based on Russell's result, though we note that for some applications, for instance to propositional attitudes, a restricted thesis in the vicinity may hold some promise. [ABSTRACT FROM AUTHOR]

The increasing complexity of embedded systems renders software verification more complex, requiring monitoring and formal techniques, like model-checking. However, to use such techniques, system engineers usually need formal expertise to express the software requirements in a formal language. To facilitate the use of model-checking tools by system engineers, our approach uses a UML model interpreter through which the software requirements can directly be expressed in UML as well. Formal requirements are encoded as UML state machines with the transition guards written in a specific observation language, which expresses predicates on the execution of the system model. Each such executable UML specification can model either a Büchi automaton or an observer automaton, and is synchronously composed with the system, to follow its execution during model-checking. Formal verification can continue at runtime for all deterministic observer automata used during offline verification by deploying them on real embedded systems. Our approach has been evaluated on multiple case studies and is illustrated, in this paper, through the user interface model of a cruise-control system. The automata-based verification results are in line with the verification of the equivalent LTL properties. The runtime overhead during monitoring is proportional to the number of monitors. [ABSTRACT FROM AUTHOR]

This paper introduces conjugate word blending as a formal model of molecular processes that occur during a DNA experimental protocol called cross-pairing Polymerase Chain Reaction (XPCR). We analyze this formal word and language operation from a computational viewpoint, by investigating closure properties of four Chomsky language families under it. We also report the molecular biology wet lab experiments based on XPCR amplification of gene sequences, which led to the notion of conjugate word blending. [ABSTRACT FROM AUTHOR]

As an important secretive attribute, opacity of cyber-physical systems (CPSs) has attracted considerable attention. Existing works on opacity mainly concentrate on the formal language method by assuming that the intruder tracks partial knowledge of observable transitions. In this paper, under the framework of Boolean semi-tensor product (BSTP) of matrix, we extend the verification of opaque property to algebraic mechanisms that have great advantages in problem description and solution. First, we show that how K -step opacity problem of nondeterministic finite automata (NFAs) can be transformed to the construction problem of a polynomial matrix that characterizes the state estimation eavesdropped by malicious intruders within the last K observations. Second, the necessary and sufficient condition of verifying K -step opacity is obtained, which is equivalent to validate the composition of elements within the polynomial matrix. Finally, the effectiveness of this result is demonstrated by an illustrative example. Taking together, the matrix-based method will be useful to deliver a novel theoretical tool for investigating the privacy-preserving problem in the related area of CPSs. [ABSTRACT FROM AUTHOR]

In this paper, we present a first-order and a propositional logic for reasoning about degrees of confirmation. We define the appropriate formal languages and describe the corresponding classes of models. We provide infinitary axiomatizations for both logics and we prove that the axiomatizations are sound and strongly complete. We also show that our propositional logic is decidable. For some restrictions of the logics, we provide finitary axiomatic systems. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Education Research (1680-6360) is the property of Angle Publishing Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The circular splicing operation is a language-theoretic operation introduced by Head to model biological phenomena on circular DNA and RNAs. It acts on pairs of circular words under conditions defined by a set of rules. A circular splicing system S is defined by giving an initial set of circular words and a set of rules. S represents a circular language from a generative point of view (splicing language). There are open questions related to the computational power of these systems. For instance, a characterization of circular splicing systems generating regular circular languages is still lacking as well as a characterization of the structure of the regular splicing languages. In this paper we give results about these questions for a special class of hybrid systems named generalized marked systems. [ABSTRACT FROM AUTHOR]

This article uses tagmemic theory as a semiotic framework to analyze symbolic logic. It attends particularly to the issue of context for meaning and the role of personal observer/participants. It focuses on formal languages, which employ no ordinary words and from one point of view have "no meaning." Attention to the context and the theorists who deploy these languages shows that formal languages have meanings at a higher level, colored by the purposes of the analysts. In fact, there is an indefinitely ascending hierarchy of theories of theories, each of which analyzes and evaluates the theories at a lower level. By analogy with Kurt Gödel's incompleteness theory, no level of the hierarchy can capture within formalism everything in a sufficiently complex system. The personal analysts always have to make judgments about how a formalized system is analogous to the world outside the system. Arguments in analytic philosophy can be useful in clarification, but neither clarification of terms nor clarification of the structure of arguments can eliminate the need for personal judgment. [ABSTRACT FROM AUTHOR]

In this paper we go further with the study initiated by Behle, Krebs and Reifferscheid (in: Proceedings CAI 2011, Lecture Notes in Computer Science, vol 6742, pp 97–114, 2011), who gave an Eilenberg-type theorem for non-regular languages via typed monoids. We provide a new extension of that result, inspired by the one carried out by Pin in the regular case in 1995, who considered classes of languages not necessarily closed under complement. We introduce the so-called positively typed monoids, and give a correspondence between varieties of such algebraic structures and positive varieties of possibly non-regular languages. We also prove a similar result for classes of languages with weaker closure properties. [ABSTRACT FROM AUTHOR]

The analytic and philosophical literature frequently refers to interpretation and translation as interchangeable concepts. Translation creatively transforms the language of a written or spoken text into another language, organises the original text and, despite the translator's efforts to remain loyal to the author's idea, some meanings will inevitably be lost or changed. Analytic authors suggest that translating the patient's experiential, embodied, and opaque narrative into a cohesive and meaningful story also changes the patient's suffering and renders it more tolerable. In parallel, I suggest that the supervisor's role includes translating the supervisee's experiential and embodied therapeutic narrative into an organised story in a formal language, according to analytic principles. The translated story enables the supervisee to share, albeit in imagination, therapeutic dilemmas and challenges with colleagues that alleviate the burden of clinical responsibility. Furthermore, translating the supervisee's therapeutic narrative helps the supervisee to acknowledge and accept the otherness in relationships, to find the missing words in his or her discourse, and to identify with and internalise the supervisor's ways of translating. [ABSTRACT FROM AUTHOR]

This paper investigates discursive structures of spoken language in formal and informal communication settings (almost 62 hours of recorded time) of urban speakers in Austria's two biggest cities Vienna and Graz and their surroundings. We focus on so-called bipartite "Operator- Skopus-Strukturen" ('operator-scope-structures'), examining their pragmatic and discourse organising function within specific conversational situations. Our main aim is to offer in-depth analyses of these structures by characterising the mental and communicative status of such utterances. Starting out with a discussion of characteristics of spoken language research, especially by arguing for the replacement of the grammatical concept of sentences with the interactional concept of turn-constructional units, we address the phenomenon of discourse markers and Operator-Skopus-Strukturen in particular. This is followed by the description of our data set and the subsequent analyses and discussion of the selected examples. According to our findings, Operator-Skopus-Strukturen appear in both conversational settings and among all groups of speakers. We demonstrate that all speakers use the structures with the same pragmatic function of giving information to their conversation partner on how to interpret and understand the message behind the utterance. Within this scope, the speaker's intention can vary depending on the conversation partner, the topic of the conversation or the situation. [ABSTRACT FROM AUTHOR]

Perception of low-level auditory cues such as frequency modulation (FM) and rise time (RT) is crucial for development of phonemic representations, segmentation of word boundaries, and attunement to prosodic patterns in language. While learning an additional language, children may develop an increased sensitivity to these cues to extract relevant information from multiple types of linguistic input. Performance on these auditory processing tasks such as FM and RT by children learning another language is, however, unknown. Here we examine 92 English-speaking 7–8-year-olds in the U.S. and their performance in FM and RT perceptual tasks at the end of their second year in Cantonese or Spanish dual-language immersion compared to children in general English education programs. Results demonstrate that children in immersion programs have greater sensitivity to FM, but not RT, controlling for various factors. The immersion program students were also observed to have better phonological awareness performance. However, individual differences in FM sensitivity were not associated with phonological awareness, a pattern typically observed in monolinguals. These preliminary findings suggest a possible impact of formal language immersion on low-level auditory processing. Additional research is warranted to understand causal relationships and ultimate impact on language skills in multilinguals. [ABSTRACT FROM AUTHOR]

Compiler correctness, in its simplest form, is defined as the inclusion of the set of traces of the compiled program in the set of traces of the original program. This is equivalent to the preservation of all trace properties. Here, traces collect, for instance, the externally observable events of each execution. However, this definition requires the set of traces of the source and target languages to be the same, which is not the case when the languages are far apart or when observations are fine-grained. To overcome this issue, we study a generalized compiler correctness definition, which uses source and target traces drawn frompotentially different sets and connected by an arbitrary relation. We set out to understand what guarantees this generalized compiler correctness definition gives us when instantiated with a non-trivial relation on traces. When this trace relation is not equality, it is no longer possible to preserve the trace properties of the source program unchanged. Instead, we provide a generic characterization of the target trace property ensured by correctly compiling a program that satisfies a given source property, and dually, of the source trace property one is required to show to obtain a certain target property for the compiled code. We show that this view on compiler correctness can naturally account for undefined behavior, resource exhaustion, different source and target values, side channels, and various abstraction mismatches. Finally, we show that the same generalization also applies to many definitions of secure compilation, which characterize the protection of a compiled program linked against adversarial code. [ABSTRACT FROM AUTHOR]

She confines the discussion to subjunctive conditionals and argues that at least I would have i conditionals [...] indefeasibly convey that the antecedent is false (call this the minority view, to be distinguished from the majority view according to which the conditionals in question merely defeasibly convey that the antecedent is false). In German, the protasis verb, as well as the apodosis verb in counterfactual conditionals, is regularly different from past tense forms. There are several options on the market, for example: (a) HT

Novel computing paradigms, e.g., the Cloud, introduce new requirements with regard to access control such as utilization of historical information and continuity of decision. However, these concepts may introduce an additional level of complexity to the underpinning model, rendering its definition and verification a cumbersome and prone to errors process. Using a formal language to specify a model and formally verify it may lead to a rigorous definition of the interactions amongst its components, and the provision of formal guarantees for its correctness. In this paper, we consider a case study where we specify a formal model in TLA + for both a policy-neutral and policy-specific UseCON usage control model. Through that, we anticipate to shed light in the analysis and verification of usage control models and policies by sharing our experience when using TLA + specific tools. [ABSTRACT FROM AUTHOR]

In addition to these examples, we also have a small number of cases ending in I -s i arising from original final geminate I -ss i ; again, syllables ending in this sequence all scan as heavy in Plautus ([30]: 19-20). I -es i or I -os i and oblique * I -es- i or * I -os- i , we would expect to find in I is- i stems a nom. sg. Keywords: Ennius; final -s; formal language; metre; Republican poetry EN Ennius final -s formal language metre Republican poetry 265 284 20 01/27/22 20211001 NES 211001 1 Introduction One of the features of the language of the Roman poets of the third, second, and to some extent first centuries BC is that a word-final syllable consisting of a short vowel followed by I -s i can scan as light even when followed by a word beginning with a consonant, as in the line below. Thus, [18]: 315-318) maintained that Ennius never used I -s i to make position in thesis, although this led him to the circular position that the presence of I -s i making position in thesis was on its own reason to doubt the validity of verses containing this feature. [Extracted from the article]

Standard definitions of logical consequence for formal languages are atomistic. They take as their starting point a range of possible assignments of semantic values to the extralogical atomic constituents of the language, each of which generates a unique truth value for each sentence. In modal logic, these possible assignments of semantic values are generated by Kripke-style models involving possible worlds and an accessibility relation. In first-order logic, they involve the standard structures of model theory, as sets of objects from which the extralogical symbols of the language receive their denotations. I argue that there is an alternative, holistic, approach to the task of defining logical consequence for a formal language. It specifies necessary and sufficient conditions for an assignment of truth values to all the sentences of the language to be compatible with the intended interpretation of its logical constants. It achieves this without invoking possible assignments of semantic values to the extralogical atomic constituents of the language, or the formal resources that are employed to generate these. I show how this approach can be successfully applied to modal propositional logic and to first-order logic, modal as well as nonmodal. I show that the holistic definitions of logical consequence that I supply for these languages are equivalent to the standard atomistic definitions. [ABSTRACT FROM AUTHOR]

We offer a novel picture of mathematical language from the perspective of speech act theory. There are distinct speech acts within mathematics (not just assertions), and, as we intend to show, distinct illocutionary force indicators as well. Even mathematics in its most formalized version cannot do without some such indicators. This goes against a certain orthodoxy both in contemporary philosophy of mathematics (which tends to see mathematics as a realm in which no pragmatic features of ordinary language are present) and in speech act theory (which tends to pay attention solely to communication in ordinary language but not to formal languages). As we will comment, the recognition of distinct illocutionary acts within logic and mathematics and the incorporation of illocutionary force indicators in the formal language for both goes back to Frege's conception of these topics. We are, therefore, going back to a Fregean perspective. This paper is part of a larger project of applying contemporary speech act theory to the scientific language of mathematics in order to uncover the varieties and regular combinations of illocutionary acts (silently) present in it. For reasons of space, we here concentrate only on assertive and declarative acts within mathematics, leaving the investigation of other kinds of acts for a future occasion. [ABSTRACT FROM AUTHOR]

One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address both the qualitative and non-functional aspects of architectures. In this paper we study the qualitative and quantitative formal modelling of architectures applied on parametric component-based systems, that consist of an unknown number of instances of each component. Specifically, we introduce an extended propositional interaction logic and investigate its first-order level which serves as a formal language for the interactions of parametric systems. Our logics achieve to encode the execution order of interactions, which is a main feature in several important architectures, as well as to model recursive interactions. Moreover, we prove the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures. We show the robustness of our theory by effectively extending our results for parametric weighted architectures. For this, we study the weighted counterparts of our logics over a commutative semiring, and we apply them for modelling the quantitative aspects of concrete architectures. Finally, we prove that the equivalence problem of weighted first-order extended interaction logic formulas is decidable in a large class of semirings, namely the class (of subsemirings) of skew fields. [ABSTRACT FROM AUTHOR]

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman’s theorem states that they precisely specify pseudovarieties, i.e., classes of finite algebras closed under finite products, subalgebras and quotients. In this article, Reiterman’s theorem is generalized to finite EilenbergMoore algebras for a monad T on a category D: we prove that a class of finite T-algebras is a pseudovariety iff it is presentable by profinite equations. As a key technical tool, we introduce the concept of a profinite monad T associated to the monad T, which gives a categorical view of the construction of the space of profinite terms. [ABSTRACT FROM AUTHOR]