# Write an assignment on application of propositional logic in computer science

References and Further Reading 1. Introduction A statement can be defined as a declarative sentence, or part of a sentence, that is capable of having a truth-value, such as being true or false. Introduction[ edit ] While propositional logic deals with simple declarative propositions, first-order logic additionally covers predicates and quantification. A predicate takes an entity or entities in the domain of discourse as input while outputs are either True or False. Consider the two sentences "Socrates is a philosopher" and "Plato is a philosopher". In propositional logicthese sentences are viewed as being unrelated and might be denoted, for example, by variables such as p and q. The predicate "is a philosopher" occurs in both sentences, which have a common structure of "a is a philosopher".

The variable a is instantiated as "Socrates" in the first sentence and is instantiated as "Plato" in the second sentence. While first-order logic allows for the use of predicates, such as "is a philosopher" in this example, propositional logic does not. Consider, for example, the first-order formula "if a is a philosopher, then a is a scholar".

This formula is a conditional statement with "a is a philosopher" as its hypothesis and "a is a scholar" as its conclusion. The truth of this formula depends on which object is denoted by a, and on the interpretations of the predicates "is a philosopher" and "is a scholar".

Quantifiers can be applied to variables in a formula. The variable a in the previous formula can be universally quantified, for instance, with the first-order sentence "For every a, if a is a philosopher, then a is a scholar". The universal quantifier "for every" in this sentence expresses the idea that the claim "if a is a philosopher, then a is a scholar" holds for all choices of a.

The negation of the sentence "For every a, if a is a philosopher, then a is a scholar" is logically equivalent to the sentence "There exists a such that a is a philosopher and a is not a scholar".

## Academic : Department of Computer Science : University of Pune

The existential quantifier "there exists" expresses the idea that the claim "a is a philosopher and a is not a scholar" holds for some choice of a.

The predicates "is a philosopher" and "is a scholar" each take a single variable. In general, predicates can take several variables. In the first-order sentence "Socrates is the teacher of Plato", the predicate "is the teacher of" takes two variables.

An interpretation or model of a first-order formula specifies what each predicate means and the entities that can instantiate the variables. These entities form the domain of discourse or universe, which is usually required to be a nonempty set.

## Formal logic - The predicate calculus | torosgazete.com

For example, in an interpretation with the domain of discourse consisting of all human beings and the predicate "is a philosopher" understood as "was the author of the Republic ", the sentence "There exists a such that a is a philosopher" is seen as being true, as witnessed by Plato.

Syntax[ edit ] There are two key parts of first-order logic. The syntax determines which collections of symbols are legal expressions in first-order logic, while the semantics determine the meanings behind these expressions.Intelligence To be intelligent you first have to know what being Intelligent is.

And you also have to know what being ignorant is. Ignorant is just another word for "Not knowing".But not knowing is not always obvious or clearly torosgazete.com's because learning is not fully understood.

The more you learn the more you should realize what you didn't know. First-order logic—also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer torosgazete.com-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such as Socrates is a man one can have expressions.

In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 torosgazete.comd of elementary algebra where the values of the variables are numbers, and the prime operations are addition and multiplication, the main operations of Boolean algebra .

* Some lab experiments must be performed using any circuit simulation software e.g. PSPICE. BACHELOR OF TECHNOLOGY (Computer Science & Engineering).

The Hard Problem of Consciousness. The hard problem of consciousness is the problem of explaining why any physical state is conscious rather than nonconscious. CSE Introduction to Computer Science.

An introduction to fundamentals of computer science. Topics covered include algorithmic design, problem-solving techniques for computer programming, fundamentals of digital logic and computer organization, the role of the operating system, introductory programming methodology including variables, assignment .

Hard Problem of Consciousness | Internet Encyclopedia of Philosophy