syllogism 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 2a4c518dea8c0143286b978109c6b817f405594d7b0b5b6594d3a064ad939a02
+  data.tar.gz: c5de24d6472be0aa3266924734f52052ca8171fa36c8605bc44c302f0027298e
+SHA512:
+  metadata.gz: abacbd989dcd3255bf90038ed25bc01362994610272067eff8f42cc5ac3ecbd4f8680c717d09232c079923c41b4e19286963b2249894565055e19f0681b920e3
+  data.tar.gz: 22d3ed160079a7ed1e96074fec616272dee0fb96516eb788bcc80830257407708ba41555ba65987095a4af57fdbd0c5d757325e3ab6f07abad3159962d789801

data/.github/workflows/test.yml

@@ -0,0 +1,47 @@
+name: Tests 
+
+on:
+  pull_request:
+    branches:
+      - main
+  push:
+    branches:
+      - main
+
+jobs:
+  unit_tests:
+    name: Unit Tests
+    if: "contains(github.event.commits[0].message, '[ci skip]') == false"
+    strategy:
+      fail-fast: false
+      matrix:
+        os:
+          - macos 
+          - ubuntu
+        ruby:
+          - 2.4
+          - 2.5
+          - 2.6
+          - 2.7
+          - 3.0
+        allow_failures:
+          - false
+        include:
+          - os: ubuntu
+            ruby: ruby-head
+            allow_failures: true
+    env:
+      BUNDLE_GEMFILE: "${{ matrix.gemfile }}"
+      ALLOW_FAILURES: "${{ matrix.allow_failures }}"
+    runs-on: ${{ matrix.os }}-latest
+    continue-on-error: ${{ endsWith(matrix.ruby, 'head') || matrix.ruby == 'debug' }}
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v2
+      - name: Setup Ruby
+        uses: ruby/setup-ruby@v1
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler-cache: true
+      - name: Test
+        run: bundle exec rake spec || $ALLOW_FAILURES

data/.gitignore

@@ -0,0 +1,11 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/Gemfile

@@ -0,0 +1,7 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in syllogism.gemspec
+gemspec
+
+gem "rake", "~> 12.0"
+gem "rspec", "~> 3.0"

data/Gemfile.lock

@@ -0,0 +1,34 @@
+PATH
+  remote: .
+  specs:
+    syllogism (0.1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    diff-lcs (1.4.4)
+    rake (12.3.3)
+    rspec (3.10.0)
+      rspec-core (~> 3.10.0)
+      rspec-expectations (~> 3.10.0)
+      rspec-mocks (~> 3.10.0)
+    rspec-core (3.10.1)
+      rspec-support (~> 3.10.0)
+    rspec-expectations (3.10.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.10.0)
+    rspec-mocks (3.10.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.10.0)
+    rspec-support (3.10.2)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  rake (~> 12.0)
+  rspec (~> 3.0)
+  syllogism!
+
+BUNDLED WITH
+   2.1.2

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2021 Jayson Virissimo
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,55 @@
+# Syllogism
+
+Check if individual statements are well-formed formulas and if whole arguments are valid in in Aristotelian logic.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'syllogism'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install syllogism
+
+## Usage
+
+```ruby
+# Individual statements:
+Syllogism::Statement.parse('all 1s are numbers').tap do |invalid_statement|
+  invalid_statement.wff? # => false
+  invalid_statement.errors
+  # => ["'1s' is an unknown atom", "'numbers' is an unknown atom"]
+end
+
+Syllogism::Statement.parse('all X is Y').tap do |valid_statement|
+  valid_statement.wff? # => true
+  valid_statement.errors # => []
+end
+
+# Entire arguments:
+Syllogism['all P is S', 'j is P', 'j is S'].valid? # => true
+
+Syllogism['no A is B', 'no C is A', 'no C is B'].valid? # => false
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/jaysonvirissimo/syllogism.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task default: :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "syllogism"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/syllogism.rb

@@ -0,0 +1,148 @@
+require "syllogism/atom"
+require "syllogism/quantity"
+require "syllogism/all"
+require "syllogism/term"
+require "syllogism/general_term"
+require "syllogism/negation"
+require "syllogism/no"
+require "syllogism/singular_term"
+require "syllogism/some"
+require "syllogism/unknown"
+require "syllogism/verb"
+require "syllogism/statement"
+require "syllogism/term_distributor"
+require "syllogism/version"
+require "syllogism/wff_checker"
+
+class Syllogism
+  attr_reader :errors, :statements
+
+  def self.[](*raw_statements)
+    parse(*raw_statements)
+  end
+
+  def self.parse(*raw_statements)
+    new(raw_statements.map { |raw_statement| Statement.parse(raw_statement) })
+  end
+
+  def initialize(statements)
+    @errors = []
+    @statements = statements
+  end
+
+  def premises
+    @premises ||= statements.take(statements.length - 1)
+  end
+
+  def conclusion
+    @conclusion ||= statements.last
+  end
+
+  def valid?
+    statements_are_well_formed? &&
+      meets_definition_of_syllogism? &&
+      distribute_terms &&
+      star_premises &&
+      star_conclusion &&
+      passes_star_test?
+  end
+
+  private
+
+  attr_writer :errors
+
+  def contains_statements?
+    if statements.any?
+      true
+    else
+      errors.push("By definition, a syllogism must contain at least one statement")
+      false
+    end
+  end
+
+  def distribute_terms
+    statements.each(&:distribute) && true
+  end
+
+  def exactly_two_of_each_term?
+    if term_histogram.values.all? { |count| count == 2 }
+      true
+    else
+      term_histogram.reject { |_term, count| count == 2 }.each do |term, count|
+        errors.push("The term '#{term}' occured #{count} time(s), but should occur exactly twice")
+      end
+
+      false
+    end
+  end
+
+  def every_general_term_is_starred_exactly_once
+    statements.each_with_object(Hash.new(0)) do |statement, stars|
+      statement.general_terms.each do |general_term|
+        stars[general_term.value] += 1 if general_term.starred?
+      end
+    end.values.all? { |star_count| star_count == 1 }
+  end
+
+  def forms_a_chain?
+    (0...statements.count - 1).map do |index|
+      current_statement = statements[index]
+      next_statement = statements[index + 1]
+      current_terms = current_statement.terms.map(&:value)
+      next_terms = next_statement.terms.map(&:value)
+
+      if (current_terms - next_terms).length == 1
+        true
+      else
+        errors.push("'#{current_statement}'' should share exactly one term with '#{next_statement}'")
+        false
+      end
+    end.all?
+  end
+
+  def meets_definition_of_syllogism?
+    contains_statements? && exactly_two_of_each_term? && forms_a_chain?
+  end
+
+  # See Harry Gensler's paper, _A simplified decision procedure for categorical syllogisms._
+  # https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-4/A-simplified-decision-procedure-for-categorical-syllogisms/10.1305/ndjfl/1093891100.full
+  def passes_star_test?
+    every_general_term_is_starred_exactly_once &&
+      there_is_exactly_one_star_on_the_right_hand_side
+  end
+
+  def star_premises
+    premises.each do |premise|
+      premise.terms.each do |term|
+        term.starred = term.distributed?
+      end
+    end
+  end
+
+  def star_conclusion
+    conclusion.terms.each do |term|
+      term.starred = !term.distributed?
+    end
+  end
+
+  def statements_are_well_formed?
+    statements.map do |statement|
+      if statement.wff?
+        true
+      else
+        statement.errors.each { |error| errors.push(error) }
+        false
+      end
+    end.all?
+  end
+
+  def term_histogram
+    statements.flat_map(&:terms).map(&:value).each_with_object(Hash.new(0)) do |value, hash|
+      hash[value] += 1
+    end
+  end
+
+  def there_is_exactly_one_star_on_the_right_hand_side
+    statements.map(&:predicate).count(&:starred?) == 1
+  end
+end

data/lib/syllogism/all.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class All < Quantity
+    VALUE = "all".freeze
+
+    def match?
+      VALUE.casecmp?(value)
+    end
+  end
+end

data/lib/syllogism/atom.rb

@@ -0,0 +1,13 @@
+class Syllogism
+  class Atom
+    attr_reader :value
+
+    def initialize(value)
+      @value = value
+    end
+
+    def match?
+      false
+    end
+  end
+end

data/lib/syllogism/general_term.rb

@@ -0,0 +1,11 @@
+class Syllogism
+  class GeneralTerm < Term
+    def match?
+      GENERAL_TERM_VALUES.include?(value)
+    end
+
+    private
+
+    GENERAL_TERM_VALUES = ("A".."Z").freeze
+  end
+end

data/lib/syllogism/negation.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class Negation < Atom
+    NEGATION_VALUE = "not".freeze
+
+    def match?
+      NEGATION_VALUE.casecmp?(value)
+    end
+  end
+end

data/lib/syllogism/no.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class No < Quantity
+    VALUE = "no".freeze
+
+    def match?
+      VALUE.casecmp?(value)
+    end
+  end
+end

data/lib/syllogism/quantity.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class Quantity < Atom
+    QUANTITY_VALUES = ["all", "some", "no"].freeze
+
+    def match?
+      QUANTITY_VALUES.include?(value)
+    end
+  end
+end

data/lib/syllogism/singular_term.rb

@@ -0,0 +1,11 @@
+class Syllogism
+  class SingularTerm < Term
+    def match?
+      SINGULAR_TERM_VALUES.include?(value)
+    end
+
+    private
+
+    SINGULAR_TERM_VALUES = ("a".."z").freeze
+  end
+end

data/lib/syllogism/some.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class Some < Quantity
+    VALUE = "some".freeze
+
+    def match?
+      VALUE.casecmp?(value)
+    end
+  end
+end

data/lib/syllogism/statement.rb

@@ -0,0 +1,92 @@
+class Syllogism
+  class Statement
+    attr_reader :atoms, :errors
+
+    def self.[](string)
+      parse(string)
+    end
+
+    def self.atomize(word)
+      ATOMIC_TYPES.map do |type|
+        type.new(word)
+      end.detect { |atom| atom.match? }
+    end
+
+    def self.parse(string)
+      new(string.split(" ").map { |word| atomize(word) })
+    end
+
+    def initialize(atoms)
+      @atoms = atoms
+      @errors = []
+    end
+
+    def distribute
+      TermDistributor.new(self).call
+    end
+
+    def general_terms
+      terms.select { |term| term.instance_of?(GeneralTerm) }
+    end
+
+    def predicate
+      terms.last
+    end
+
+    def subject
+      terms.first
+    end
+
+    def terms
+      @terms ||= atoms.select { |atom| TERM_TYPES.include?(atom.class) }
+    end
+
+    def to_s
+      atoms.map(&:value).join(" ")
+    end
+
+    def wff?
+      known_atoms? && verb? && known_formula?
+    end
+
+    private
+
+    ATOMIC_TYPES = [
+      All,
+      No,
+      Some,
+      GeneralTerm,
+      Verb,
+      Negation,
+      SingularTerm,
+      Unknown
+    ].freeze
+
+    TERM_TYPES = [GeneralTerm, SingularTerm].freeze
+
+    def known_atoms?
+      unknown.none?
+    end
+
+    def known_formula?
+      WffChecker.new(self).any?
+    end
+
+    def unknown
+      @unknown ||= atoms.select do |atom|
+        atom.instance_of?(Unknown)
+      end.tap do |atoms|
+        atoms.each { |atom| errors.push("'#{atom.value}' is an unknown atom") }
+      end
+    end
+
+    def verb?
+      if atoms.any? { |atom| atom.instance_of?(Verb) }
+        true
+      else
+        errors.push("'#{self}' does not contain the verb 'is' or 'are'")
+        false
+      end
+    end
+  end
+end

data/lib/syllogism/term.rb

@@ -0,0 +1,13 @@
+class Syllogism
+  class Term < Atom
+    attr_writer :distributed, :starred
+
+    def distributed?
+      !!@distributed
+    end
+
+    def starred?
+      !!@starred
+    end
+  end
+end

data/lib/syllogism/term_distributor.rb

@@ -0,0 +1,52 @@
+class Syllogism
+  class TermDistributor
+    def initialize(statement)
+      @atoms = statement.atoms
+      @current = nil
+      @position = 0
+      @terms = statement.terms
+    end
+
+    def call
+      atoms.each_with_index do |atom, index|
+        self.current, self.position = atom, index
+        if term?
+          atom.distributed = should_distribute?
+        end
+      end
+    end
+
+    private
+
+    attr_accessor :current, :position
+    attr_reader :atoms, :terms
+
+    def anywhere_after_no?
+      preceeding_types.include?(No)
+    end
+
+    def immediately_after_all?
+      immediate_predecessor == All
+    end
+
+    def immediately_after_not?
+      immediate_predecessor == Negation
+    end
+
+    def immediate_predecessor
+      preceeding_types.last
+    end
+
+    def preceeding_types
+      atoms.take(position).map(&:class)
+    end
+
+    def should_distribute?
+      immediately_after_all? || immediately_after_not? || anywhere_after_no?
+    end
+
+    def term?
+      terms.include?(current)
+    end
+  end
+end

data/lib/syllogism/unknown.rb

@@ -0,0 +1,7 @@
+class Syllogism
+  class Unknown < Atom
+    def match?
+      true
+    end
+  end
+end

data/lib/syllogism/verb.rb

@@ -0,0 +1,9 @@
+class Syllogism
+  class Verb < Atom
+    VERB_VALUES = ["is", "are"].freeze
+
+    def match?
+      VERB_VALUES.include?(value.downcase)
+    end
+  end
+end

data/lib/syllogism/version.rb

@@ -0,0 +1,3 @@
+class Syllogism
+  VERSION = "0.1.0"
+end

data/lib/syllogism/wff_checker.rb

@@ -0,0 +1,36 @@
+class Syllogism
+  class WffChecker
+    def initialize(statement)
+      @statement = statement
+    end
+
+    def any?
+      WELL_FORMED_FORMULAS.any? do |formula|
+        atom_types == formula
+      end
+    end
+
+    private
+
+    attr_reader :statement
+
+    WELL_FORMED_FORMULAS = [
+      [All, GeneralTerm, Verb, GeneralTerm],
+      [Some, GeneralTerm, Verb, GeneralTerm],
+      [SingularTerm, Verb, GeneralTerm],
+      [SingularTerm, Verb, SingularTerm],
+      [No, GeneralTerm, Verb, GeneralTerm],
+      [Some, GeneralTerm, Verb, Negation, GeneralTerm],
+      [SingularTerm, Verb, Negation, GeneralTerm],
+      [SingularTerm, Verb, Negation, SingularTerm]
+    ].freeze
+
+    def atoms
+      statement.atoms
+    end
+
+    def atom_types
+      @atom_types ||= atoms.map { |atom| atom.class }
+    end
+  end
+end

data/syllogism.gemspec

@@ -0,0 +1,29 @@
+require_relative "lib/syllogism/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "syllogism"
+  spec.version = Syllogism::VERSION
+  spec.authors = ["Jayson Virissimo"]
+  spec.email = ["jayson.virissimo@asu.edu"]
+
+  spec.summary = "Proof checker for arguments in Aristotle's term logic"
+  spec.description = "Proof checker for arguments in Aristotle's term logic"
+  spec.homepage = "https://github.com/jaysonvirissimo/syllogism"
+  spec.license = "MIT"
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
+
+  spec.metadata["allowed_push_host"] = "https://rubygems.org/"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/jaysonvirissimo/syllogism"
+  spec.metadata["changelog_uri"] = "https://github.com/jaysonvirissimo/syllogism"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path("..", __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir = "exe"
+  spec.executables = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+end

metadata

@@ -0,0 +1,74 @@
+--- !ruby/object:Gem::Specification
+name: syllogism
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Jayson Virissimo
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2021-05-26 00:00:00.000000000 Z
+dependencies: []
+description: Proof checker for arguments in Aristotle's term logic
+email:
+- jayson.virissimo@asu.edu
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".github/workflows/test.yml"
+- ".gitignore"
+- ".rspec"
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/syllogism.rb
+- lib/syllogism/all.rb
+- lib/syllogism/atom.rb
+- lib/syllogism/general_term.rb
+- lib/syllogism/negation.rb
+- lib/syllogism/no.rb
+- lib/syllogism/quantity.rb
+- lib/syllogism/singular_term.rb
+- lib/syllogism/some.rb
+- lib/syllogism/statement.rb
+- lib/syllogism/term.rb
+- lib/syllogism/term_distributor.rb
+- lib/syllogism/unknown.rb
+- lib/syllogism/verb.rb
+- lib/syllogism/version.rb
+- lib/syllogism/wff_checker.rb
+- syllogism.gemspec
+homepage: https://github.com/jaysonvirissimo/syllogism
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org/
+  homepage_uri: https://github.com/jaysonvirissimo/syllogism
+  source_code_uri: https://github.com/jaysonvirissimo/syllogism
+  changelog_uri: https://github.com/jaysonvirissimo/syllogism
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.3.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.3
+signing_key:
+specification_version: 4
+summary: Proof checker for arguments in Aristotle's term logic
+test_files: []