# Nomenclature for AND-operation on boolean reasoning

I develop a computer program to summarize a boolean decision. This program takes into account operators AND and OR. For the OR-operator, I can call it alternative, since this is how grammar rules call phrases with such conjunction and suits well the logical context. Analogously, I can refer to grammar for AND-operator. However, addition seems not very contextually related to logic, although it assigns correctly the operation goal. I assign the operation to term argument for now in the absence of any other more adequate term. But, as you may infer, is not precise enough (even broader than and-operator, and also relating to alternative reasoning).

What would logicians suggest?

• OR is disjunctive while AND is conjunctive. See Boolean Logic: Operations. Commented Feb 2, 2023 at 15:52
• maybe instead of "argument" use the term "(necessary) condition" or "common ground between options"? Commented Feb 2, 2023 at 16:33
• @MauroALLEGRANZA I saw you rollback the tag "philosophy-of-computer-science", and I thought I might understand your rationale. It's a legitimate domain of philosophical discourse as evidenced by the SEP's The Philosophy of Computer Science and numerous books by presses Oxford, Springer-Verlag, etc. Did you have a specific objection to the use here?
– J D
Commented Feb 2, 2023 at 16:34
• @JD I also think this question is relevant since it belongs to philosophy of computer science. There are many philosophy of mathematics questions that should be also called off-topic if this is called such.
– user64708
Commented Feb 27, 2023 at 10:33
• There is a first time for everything, even for a post revival. Commented Mar 6, 2023 at 23:37

Welcome, Bruno!

As a computer person myself, let me bridge the gap for you. There is well-established logical terminology around our use of PL syntax such as {AND, &, &&} and {OR, |, ||} in programing language expressions that computer scientists and programmers generally observe. The former is called logical conjunction, and the latter is called logical disjunction. These terms come right out of the same mathematical logic that lead to the design of electronic computers in the late thirties and forties.

You also use the term 'argument'. What computer scientists refer to as sub-routines which are an outgrowth of the innovation of structured programming also has equivalent logical nomenclature. For instance, sub-routines (now methods in OOP) both as procedures and functions can have parameters which we use to pass arguments either by address or reference. Logic refers to this as predication, and arguments are nothing more than bound variables with a typed domain of discourse. These are the sorts of terms that are used in something called predicate logic (or quantificational or first order logic). The notation for such a logic has what is the familiar method syntax that we also share with mathematicians: f( ). In CS, it ultimately comes from thinkers involved with lamda calculus which is why you'll hear the term 'lambdas' used in programming language discussion.

As for the relation of addition, addition can be defined as a function: