The Formal Language of Propositional Logic

2022 ◽  
pp. 23-35
Author(s):  
Mircea Reghiş ◽  
Eugene Roventa
Author(s):  
Theodore Hailperin

George Boole, a British mathematician, is credited with making a fundamental contribution to modern logic. If Leibniz’s manuscript essays on logic, effectively unknown until the end of the nineteenth century, are excluded, then Boole’s algebra of logic (1847, 1854) was the first successful mathematical treatment of one part of logic. The treatment was mathematical in the broad sense of using a formal language expressed in symbols with definite rules. It was also mathematical in a narrow sense of being closely modelled after numerical algebra, from which it differed by an additional axiom, x2=x. Letter symbols of this algebra were conceived as representing classes, 1 standing for a ‘universe’ of objects and 0 for the empty class. By identifying logical terms with their extensions, that is, with classes, inferences of a much more general character than those of the traditional syllogistic could be carried out. Boole also showed how this algebra could be used in propositional logic, presenting its earliest systematic general formulation.


1985 ◽  
Vol 14 (199) ◽  
Author(s):  
Gudmund Skovbjerg Frandsen

<p>Les Valiant has recently conceived a remarkable mathematical model of learnability. The originality appears through several facets of the model. Objects belonging to a specific concept are given a measure of naturalness in the form of a probability distribution. The learning of a concept takes place by means of a protocol that among other tools allows the use of a source of natural examples. A concept is learnable if a recognition algorithm can be synthesized within a polynomial number of steps. The recognition algorithm is allowed to be incorrect for an adjustable fraction of inputs measured with respect to naturalness.</p><p>Technically the model is based on the propositional logic over a finite number of Boolean variables. However, the underlying ideas are quite universal and can be realised by means of an almost arbitrary formal language, which we will demonstrate in this note. A single concept may include infinitely many objects within a formal language frame. Fortunately we can learn such concepts from finite sets of examples only. We shall prove a specific class of concepts to be learnable within the nontrivial formal language of predicate logic.</p>


1987 ◽  
Vol 26 (03) ◽  
pp. 93-98 ◽  
Author(s):  
F. Wingert

SummaryA formal language is presented which is used to generate a transformation table for mapping SNOMED statements to ICD codes. Non-terminal symbols define parts of the SNOMED space, the highest order of which corresponds to ICD categories. Performance of the corresponding program system and remaining problems are described.


2019 ◽  
Author(s):  
Matheus Pereira Lobo

All nine axioms and a single inference rule of logic (Modus Ponens) within the Hilbert axiomatic system are presented using capital letters (ABC) in order to familiarize the beginner student in hers/his first contact with the topic.


2003 ◽  
Author(s):  
Ofer Strichman ◽  
Sanjit A. Seshia ◽  
Randal E. Bryant
Keyword(s):  

2020 ◽  
Vol 48 (1) ◽  
pp. 47-100
Author(s):  
Melitta Gillmann

AbstractBased on a corpus study conducted using the GerManC corpus (1650–1800), the paper sketches the functional and sociosymbolic development of subordinate clause constructions introduced by the subjunctor da ‘since’ in different text genres. In the second half of the 17th and the first half of the 18th century, the da clauses were characterized by semantic vagueness: Besides temporal, spatial and causal relations, the subjunctor established conditional, concessive, and adversative links between clauses. The corpus study reveals that different genres are crucial to the readings of da clauses. Spatial and temporal usages, for example, occur more often in sermons than in other genres. The conditional reading, in contrast, strongly tends to occur in legal texts, where it displays very high frequency. This could be the reason why da clauses carry indexical meaning in contemporary German and are associated with formal language. Over the course of the 18th century, the causal usages increase in all genres. Surprisingly, these causal da clauses tend to be placed in front of the matrix clause despite the overall tendency of causal clauses to follow the matrix clause.


2020 ◽  
Author(s):  
Michał Walicki

Abstract Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. Graphs are particularly well suited for studying circularity, and we provide some general means for verifying that circular or apparently circular extensions are conservative. Traditional syntactic means of ensuring conservativity, like definitional extensions or positive occurrences guaranteeing exsitence of fixed points, emerge as special cases.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.


Sign in / Sign up

Export Citation Format

Share Document